#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
#include<cmath>
#include<iomanip>
using namespace std;
using ll = long long;



const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        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(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

int now[1<<17];
vector<int> g[1<<17];

mint ans;

pair<mint,mint> dfs(int ni,int p){
    mint a = 0;
    mint b = 1;
    for(auto &to:g[ni]) if(to!=p){
        auto nxt = dfs(to,ni);
        mint na = 0;
        mint nb = 0;
        na += b * nxt.first + a * nxt.first + a*nxt.second;
        nb += a * nxt.first + b * nxt.second + b * nxt.first;
        a = na;b = nb;
    }
    if(now[ni]) swap(a,b);
    return make_pair(a,b);
}
int main(){
    int n;
    cin>>n;
    for(int i = 1;i<n;i++){
        int u,v;
        cin>>u>>v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    for(int i = 0;i<30;i++){
        for(int j = 0;j<n;j++) now[j] = (a[j]>>i&1);
        auto nn = dfs(0,-1).first;
        ans += mint(1<<i) * nn;
    }
    cout<<ans<<endl;
        
}