#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

const int N = 100000;

int x[N];
int a[N];
vector<int> g[N];
mint dp[N][2];

void dfs(int v, int par){
    if(x[v] == 0){
        dp[v][0] = 1;
        dp[v][1] = 0;
    }else{
        dp[v][0] = 0;
        dp[v][1] = 1;
    }
    for(int to: g[v]){
        if(to == par) continue;
        dfs(to, v);
        vector<mint> u = {dp[to][0]+dp[to][1], dp[to][1]};

        mint x0 = dp[v][0]*u[0] + dp[v][1]*u[1];
        mint x1 = dp[v][0]*u[1] + dp[v][1]*u[0];
        dp[v][0] = x0;
        dp[v][1] = x1;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    for(int i = 0; i < n-1; i++){
        int u, v; cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    mint ans = 0;
    for(int i = 0; i < 30; i++){
        for(int j = 0; j < n; j++){
            if(a[j]&(1<<i)) x[j] = 1;
            else x[j] = 0;
        }
        dfs(0, -1);
        ans += dp[0][1]*(1<<i);
    }
    cout << ans << endl;
}