#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

const ll mod = 998244353;

void dfs(int n, int p, vector<ll>& A, int s, vector<vector<int>>& G, vector<vector<ll>>& dp){
  rep(i,sz(G[n])){
    int x = G[n][i];
    if(x==p) continue;
    dfs(x,n,A,s,G,dp);
  }
  dp[0][n] = ((A[n]>>s)&1)==0;
  dp[1][n] = 1-dp[0][n];
  rep(i,sz(G[n])){
    int x = G[n][i];
    if(x==p) continue;
    ll t0 = dp[0][n];
    ll t1 = dp[1][n];
    dp[0][n] = (t0 * (dp[0][x] + dp[1][x]) + t1 * (dp[1][x])) % mod;
    dp[1][n] = (t0 * (dp[1][x]) + t1 * (dp[0][x] + dp[1][x])) % mod;
  }
}

int main(){
  int N; cin >> N;
  vector<vector<int>> G(N);
  rep(i,N-1){
    int a,b; cin >> a >> b; a--; b--;
    G[a].pb(b);
    G[b].pb(a);
  }
  vector<ll> A(N);
  rep(i,N) cin >> A[i];
  ll ans = 0;
  rep(s,30){
    vector<vector<ll>> dp(2,vector<ll>(N,0));
    dfs(0,-1,A,s,G,dp);
    ans += dp[1][0] * (1LL<<s) % mod;
    ans %= mod;
  }
  cout << ans % mod << '\n';
  return 0;
};