#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

ll N;
vvl G;
vl A;

vector<mint> dfs(ll n, ll p, vl& B) {
    vector<mint> dp(2, 0);
    dp[B[n]] = 1;
    for (auto v : G[n]) {
        if (v == p) continue;
        vector<mint> merge(2, 0);
        auto ndp = dfs(v, n, B);
        merge[0] = dp[0]*(ndp[0]+ndp[1])+dp[1]*ndp[1];
        merge[1] = dp[1]*(ndp[0]+ndp[1])+dp[0]*ndp[1];
        dp = merge;
    }
    return dp;
}

mint func(vl B) {
    auto dp = dfs(0, -1, B);
    return dp[1];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    cin >> N;
    G.assign(N, vl());
    rep (_, N-1) {
        ll u, v;
        cin >> u >> v;
        u --; v --;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    A.assign(N, -1);
    input(A);

    mint ans = 0;
    rep (i, 30) {
        vl B;
        for (auto a : A) {
            B.push_back((a>>i) & 1);
        }
        ans += func(B)*(1LL<<i);
    }

    print(ans.val());
}