#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const {
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {
        return pow(modc-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{
        return x == a.x;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
};

vector<vector<int>> E;
vector<int> bt;
vector<vector<mint>> dp;

void dfs(int from, int p){

    mint z=0, o=0;
    if (bt[from] == 0) z = 1;
    else o = 1;
    for (auto to : E[from]){
        if (p == to) continue;
        dfs(to, from);

        mint zz=0, oo=0;
        //つなげる
        zz += z * dp[to][0];
        zz += o * dp[to][1];
        oo += z * dp[to][1];
        oo += o * dp[to][0];

        //削除する
        zz += z * dp[to][1];
        oo += o * dp[to][1];

        swap(o, oo);
        swap(z, zz);
    }

    dp[from] = {z, o};
}

int main(){

    int N, x, y;
    cin >> N;
    E.resize(N);
    for (int i=0; i<N-1; i++){
        cin >> x >> y; x--; y--;
        E[x].push_back(y);
        E[y].push_back(x);
    }

    vector<int> A(N);
    for (int i=0; i<N; i++) cin >> A[i];

    mint ans=0;
    dp.resize(N, vector<mint>(2));
    bt.resize(N);

    for (int i=0; i<30; i++){
        for (int j=0; j<N; j++){
            dp[j][0] = 0; dp[j][1] = 0;
        }
        for (int j=0; j<N; j++){
            if (1<<i & A[j]) bt[j] = 1;
            else bt[j] = 0;
        }
        dfs(0, -1);
        ans += dp[0][1] * (1<<i);
    }

    cout << ans << endl;

    return 0;
}