#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    constexpr ll mod = 998244353;
    int n; cin >> n;
    vector<vector<int>> tr(n);
    for(int i = 0; i < n-1; i++) {
        int u, v; cin >> u >> v; u--; v--;
        tr[u].push_back(v);
        tr[v].push_back(u);
    }
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    ll ans = 0;
    for(int k = 0; k < 30; k++) {
        // dp[i][j]:=頂点jを根をする部分木で、根を含む連結成分のxorがi
        vector<vector<ll>> dp(2, vector<ll>(n));
        vector<int> seen(n);
        vector<vector<int>> child(n);
        stack<int> stk;
        stk.push(~0);
        stk.push(0);
        while(!stk.empty()) {
            int u = stk.top(); stk.pop();
            if(u >= 0) {
                seen[u] = 1;
                for(int v : tr[u]) {
                    if(seen[v]) continue;
                    child[u].push_back(v);
                    stk.push(~v);
                    stk.push(v);
                }
            } else {
                u = ~u;
                dp[a[u]>>k&1][u] = 1;
                for(int v : child[u]) {
                    tie(dp[0][u], dp[1][u]) = make_tuple(
                        (dp[0][u]*dp[0][v] + dp[0][u]*dp[1][v] + dp[1][u]*dp[1][v]) % mod,
                        (dp[0][u]*dp[1][v] + dp[1][u]*dp[0][v] + dp[1][u]*dp[1][v]) % mod
                    );
                }
            }
        }
        ans += dp[1][0] << k;
    }
    cout << ans % mod << endl;
}