#include <bits/stdc++.h>
using namespace std;
const int N = 100017, LOG = 20, root = 1;
int cnt[N][LOG], f[N], a[N], sz[N], num[N];
long long ans = 0;
vector<int> adj[N];
void p_dfs(int v, int p = 0) {
  f[v] = f[p] ^ a[v];
  sz[v]++;
  for (auto u : adj[v]) {
    if (u == p) continue;
    p_dfs(u, v);
    sz[v] += sz[u];
  }
  return;
}
long long tget(int x, int id) {
  long long ret = 0;
  for (int j = LOG - 1; j >= 0; j--) {
    if (x & (1LL << j))
      ret += (long long)(num[id] - cnt[id][j]) * (1LL << j);
    else
      ret += (long long)cnt[id][j] * (1LL << j);
  }
  return ret;
}
void tadd(int x, int id) {
  num[id]++;
  for (int j = 0; j < LOG; j++) {
    if (x & (1LL << j)) cnt[id][j]++;
  }
  return;
}
void get_ans(int v, int p, int x, int id) {
  ans += tget(f[v] ^ x, id);
  for (auto u : adj[v]) {
    if (u == p) continue;
    get_ans(u, v, x, id);
  }
  return;
}
void add(int v, int p, int id) {
  tadd(f[v], id);
  for (auto u : adj[v]) {
    if (u == p) continue;
    add(u, v, id);
  }
  return;
}
void l_dfs(int v, int p = 0) {
  int big_child = -1, mx = -1;
  for (auto u : adj[v]) {
    if (u == p) continue;
    l_dfs(u, v);
    if (sz[u] > mx) {
      mx = sz[u];
      big_child = u;
    }
  }
  if (big_child == -1) {
    ans += a[v];
    add(v, p, v);
    return;
  }
  for (auto u : adj[v]) {
    if (u == p || u == big_child) continue;
    get_ans(u, v, a[v], big_child);
    add(u, v, big_child);
  }
  for (int j = 0; j < LOG; j++) cnt[v][j] = cnt[big_child][j];
  num[v] = num[big_child];
  ans += tget(f[v] ^ a[v], v);
  tadd(f[v], v);
  ans += a[v];
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    adj[v].push_back(u);
    adj[u].push_back(v);
  }
  p_dfs(root);
  l_dfs(root);
  cout << ans << '\n';
}
