#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
int n;
vector<vector<int>> E;
vector<int> b;
vector<vector<mint>> dp;
void dfs(int cv,int pv){
	vector<mint> tdp(2,0);
	tdp[b[cv]] = 1;
	rep(i,E[cv].size()){
		int to = E[cv][i];
		if(to==pv)continue;
		dfs(to,cv);
		vector<mint> ndp(2,0);
		rep(j,2){
			rep(k,2){
				ndp[j^k] += tdp[j] * dp[to][k];
				if(k==1){
					ndp[j] += tdp[j] * dp[to][k];
				}
			}
		}
		swap(tdp,ndp);
	}	
	dp[cv] = tdp;
}

int main(){
	cin>>n;
	E.resize(n);
	rep(i,n-1){
		int a,b;
		cin>>a>>b;
		a--,b--;
		E[a].push_back(b);
		E[b].push_back(a);
	}
	
	mint ans = 0;
	vector<int> a(n);
	rep(i,n)cin>>a[i];
	b.resize(n);
	rep(i,30){
		rep(j,n)b[j] = (a[j]>>i)&1;
		dp.assign(n,vector<mint>(2,0));
		dfs(0,-1);
		ans += dp[0][1] * mint(2).pow(i);
		
	}
	
	cout<<ans.val()<<endl;
	
	
	return 0;
}