#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#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 repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

void dfs(vector<ll> &val, vector<vector<ll>> &graph, ll v, vector<bool> &isvisited, vector<vector<ll>> &treedp){
    isvisited[v] = true;

    vector<ll> ret(2, 0);
    ret[val[v]]++;
    for (ll x: graph[v]){
        if (isvisited[x]){
            continue;
        }

        dfs(val, graph, x, isvisited, treedp);
        vector<ll> new_ret(2, 0);
        // 下の辺を切らない
        for (ll j = 0; j < 2; j++){
            for (ll k = 0; k < 2; k++){
                new_ret[j ^ k] += ret[j] * treedp[x][k];
                new_ret[j ^ k] %= mod2;
            }
        }
        // 下の辺を切る
        new_ret[0] += ret[0] * treedp[x][1];
        new_ret[1] += ret[1] * treedp[x][1];

        for (ll j = 0; j < 2; j++){
            ret[j] = new_ret[j];
        }
    }
    for (ll j = 0; j < 2; j++){
        treedp[v][j] = ret[j];
    }
}

int main(){
    ll N;
    cin >> N;
    vector<ll> u(N - 1);
    vector<ll> v(N - 1);
    for (ll i = 0; i < N - 1; i++){
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    vector<ll> A(N);
    for (ll i = 0; i < N; i++){
        cin >> A[i];
    }

    vector<vector<ll>> graph(N, vector<ll>(0));
    for (ll i = 0; i < N - 1; i++){
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }

    // 木 dp
    ll ans = 0;
    for (ll i = 0; i < 30; i++){
        vector<ll> val(N);
        for (ll j = 0; j < N; j++){
            val[j] = ((A[j] >> i) & 1);
        }
        
        // 「ここまでの連結成分の XOR が i である切り方の総数」
        // 下の XOR が 1 のときのみ辺を切れる→マージできる
        vector<bool> isvisited(N, false);
        vector<vector<ll>> treedp(N, vector<ll>(2, 0));
        dfs(val, graph, 0, isvisited, treedp);

        ans += treedp[0][1] * (1LL << i);
        ans %= mod2;
    }
    cout << ans << endl;
}