#include <bits/stdc++.h>
using namespace std;
long long int power[31] = {0};
long long int n;
vector<long long int> a;
vector<vector<long long int>> adj;
long long int ans = 0;
void DFS(long long int v, long long int par,
         vector<pair<long long int, long long int>>& dp,
         vector<long long int>& d) {
  if (adj[v].size() == 1 && v != 1) {
    return;
  }
  for (long long int j = 0; j < adj[v].size(); j++) {
    long long int u = adj[v][j];
    if (u != par) {
      DFS(u, v, dp, d);
      if (d[v]) {
        dp[v].first += dp[u].second;
        dp[v].second += dp[u].first;
        if (d[u]) {
          dp[v].second++;
        } else {
          dp[v].first++;
        }
      } else {
        dp[v].first += dp[u].first;
        dp[v].second += dp[u].second;
        if (d[u]) {
          dp[v].first++;
        } else {
          dp[v].second++;
        }
      }
    }
  }
}
void DFS2(long long int v, long long int par,
          vector<pair<long long int, long long int>>& dp2,
          vector<pair<long long int, long long int>>& dp,
          vector<long long int>& d, long long int& x) {
  if (v == 1) {
    dp2[v].first = dp[v].first;
    dp2[v].second = dp[v].second;
    x += dp2[v].first;
    for (long long int j = 0; j < adj[v].size(); j++) {
      long long int u = adj[v][j];
      if (u != par) {
        DFS2(u, v, dp2, dp, d, x);
      }
    }
    return;
  }
  dp2[v].first = dp[v].first;
  dp2[v].second = dp[v].second;
  long long int c1 = 0, c2 = 0;
  if (d[v]) {
    c1 = dp2[par].second;
    c2 = dp2[par].first;
    if (d[par]) {
      c2++;
      c1 -= dp[v].first + 1;
      c2 -= dp[v].second;
    } else {
      c1++;
      c1 -= dp[v].second;
      c2 -= dp[v].first + 1;
    }
  } else {
    c1 = dp2[par].first;
    c2 = dp2[par].second;
    if (d[par]) {
      c1++;
      c1 -= dp[v].second + 1;
      c2 -= dp[v].first;
    } else {
      c2++;
      c1 -= dp[v].first;
      c2 -= dp[v].second + 1;
    }
  }
  dp2[v].first += c1;
  dp2[v].second += c2;
  x += dp2[v].first;
  for (long long int j = 0; j < adj[v].size(); j++) {
    long long int u = adj[v][j];
    if (u != par) {
      DFS2(u, v, dp2, dp, d, x);
    }
  }
}
long long int solve() {
  cin >> n;
  a.resize(n + 1);
  adj.resize(n + 1);
  power[0] = 1;
  for (long long int j = 1; j <= 30; j++) {
    power[j] = power[j - 1] * 2;
  }
  for (long long int j = 1; j <= n; j++) {
    cin >> a[j];
  }
  for (long long int j = 0; j < n - 1; j++) {
    long long int v1, v2;
    cin >> v1 >> v2;
    adj[v1].push_back(v2);
    adj[v2].push_back(v1);
  }
  for (long long int j = 0; j <= 30; j++) {
    vector<long long int> d = a;
    long long int x = 0;
    for (long long int i = 1; i <= n; i++) {
      d[i] = ((a[i] & power[j]) == 0 ? 0 : 1);
    }
    vector<pair<long long int, long long int>> dp(n + 1, {0, 0});
    DFS(1, 0, dp, d);
    vector<pair<long long int, long long int>> dp2(n + 1, {0, 0});
    DFS2(1, 0, dp2, dp, d, x);
    assert(x % 2 == 0);
    x /= 2;
    for (long long int i = 1; i <= n; i++) {
      if (d[i]) {
        x++;
      }
    }
    cout << "\n";
    ans += x * power[j];
  }
  cout << ans << "\n";
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
