#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define REP(A,B) for(int (A)=0;(A)<(B);(A)++)

#define lld long double
#define ll long long
#define pb push_back
int n;
int S[333333];
vector<int> nxt[333333];
int comp[333333];

int cbit = 0;
int csize = 0;
void dfs(int u, int color, int par) {
	//printf("contains %d\n", u);
	csize++;
	comp[u] = color;
	for(int v : nxt[u]) {
		if(v == par)
			continue;
		if((S[u]&S[v])&(1<<cbit)) {
			dfs(v, color, u);
		}
	}
}

int main() {
	scanf("%d", &n);
	ll ans = 0;
	REP(i, n) {
		scanf("%d", S+i);
		ans += S[i];
	}
	ll sum = 0;
	REP(i, n-1) {
		int a,b;
		scanf("%d%d", &a, &b);
		nxt[a].pb(b);
		nxt[b].pb(a);
	}
	for(cbit = 0; cbit < 20; cbit++) {
		memset(comp, -1, sizeof(comp));
		csize = 0;
		int C = 0;
		REP(i, n) {
			if(comp[i] == -1) {
				csize = 0;
				//printf("init from i=%d, cbit=%d\n", i, cbit);
				dfs(i, C, -1);
				ans += (1LL<<cbit)*(csize*((ll)csize-1))/2;
			}
		}
	}
	printf("%lld\n", ans);

	return 0;
}