#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
vector<int>a;
vector<int>to[200005];
mint dp[100005][30][2][2];// now end
void marge(int now, int pre) {
	mint ndp[30][2][2];
	rep(i, 30) {
		rep(a, 2)rep(b, 2)rep(c, 2)rep(d, 2) {
			// 切断
			ndp[i][a][b & c & d] += dp[now][i][a][b] * dp[pre][i][c][d];
			// 繋ぐ
			ndp[i][a ^ c][b & d] += dp[now][i][a][b] * dp[pre][i][c][d];
		}
	}
	swap(dp[now], ndp);
}
void dfs(int v, int d = 0, int p = -1) {
	rep(i, 30) {
		if (1 & (a[v] >> i))dp[v][i][1][1] = 1;
		else dp[v][i][0][1] = 1;
	}
	for (int e : to[v]) {
		if (p == e) continue;
		dfs(e, d + 1, v);
		marge(v, e);
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	a.resize(n);
	rep(i, n)cin >> a[i];
	dfs(0);
	mint ans = 0;
	rep(i, 30)ans += (1 << i) * dp[0][i][1][1];
	cout << ans.val() << endl;
	return 0;
}