#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
int sz[100005];
int a[100005], ds[100005][20], dp[100005][20];
vector<int> mp[100005];
long long ans;
void dfs(int x, int pa) {
  for (int c : mp[x])
    if (c != pa) {
      dfs(c, x);
      sz[x] += sz[c];
      for (int(j) = 0; (j) < (int)(20); (j)++) ds[x][j] += dp[c][j];
    }
  for (int(j) = 0; (j) < (int)(20); (j)++) {
    int val = (1 << j);
    int me = (a[x] >> j) & 1;
    for (int c : mp[x])
      if (c != pa) {
        int s1 = dp[c][j], s0 = sz[c] - s1;
        if (me == 1) {
          ans += (long long)s0 * val;
        } else {
          ans += (long long)s1 * val;
        }
      }
    if (me == 1)
      dp[x][j] = sz[x] - ds[x][j] + 1;
    else
      dp[x][j] = ds[x][j];
  }
  sz[x]++;
}
void dfs2(int j, int x, int pa, int o0, int o1) {
  int val = (1 << j);
  int me = (a[x] >> j) & 1;
  if (me == 1) {
    ans += (long long)o0 * val;
  } else {
    ans += (long long)o1 * val;
  }
  for (int c : mp[x])
    if (c != pa) {
      int cur0, cur1;
      if (me == 1) {
        cur0 = sz[x] - dp[x][j] - (dp[c][j]) + o1;
        cur1 = sz[x] - 1 - ds[x][j] - (sz[c] - dp[c][j]) + o0 + 1;
      } else {
        cur1 = ds[x][j] - dp[c][j] + o1;
        cur0 = sz[x] - 1 - ds[x][j] - (sz[c] - dp[c][j]) + o0 + 1;
      }
      dfs2(j, c, x, cur0, cur1);
    }
}
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  for (int i = 0, u, v; i < n - 1; i++) {
    scanf("%d%d", &u, &v);
    mp[u].push_back(v);
    mp[v].push_back(u);
  };
  dfs(1, 0);
  for (int(j) = 0; (j) < (int)(20); (j)++) dfs2(j, 1, 0, 0, 0);
  assert(ans % 2 == 0);
  ans /= 2;
  for (int(i) = 1; (i) <= (int)(n); (i)++) ans += a[i];
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
