#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  vector<int> b;
  queue<int> Q;
  Q.push(0);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    b.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  long long ans = 0;
  for (int i = 0; i < 30; i++){
    vector<vector<long long>> dp(2, vector<long long>(N, 0));
    for (int v : b){
      dp[A[v] >> i & 1][v] = 1;
      for (int w : c[v]){
        long long x = (dp[0][v] * dp[0][w] + dp[0][v] * dp[1][w] + dp[1][v] * dp[1][w]) % MOD;
        long long y = (dp[1][v] * dp[0][w] + dp[1][v] * dp[1][w] + dp[0][v] * dp[1][w]) % MOD;
        dp[0][v] = x;
        dp[1][v] = y;
      }
    }
    ans += (1 << i) * dp[1][0] % MOD;
    ans %= MOD;
  }
  cout << ans << endl;
}