#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int MOD=998244353;
vector<int> G[100100];
ll dp[100100][2];

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  vector<ll> B(30);
  B[0]=1;
  rep(i,29) B[i+1]=B[i]*2%MOD;

  int n;
  cin>>n;
  rep(i,n-1){
    int u,v;
    cin>>u>>v;
    u--,v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  vector<ll> A(n);
  rep(i,n) cin>>A[i];
  
  auto f=[&](auto f,int v,int p,int i)->void{
    int cnt=0;
    for(auto nv:G[v]){
      if(nv==p) continue;
      cnt++;
    }
    if(A[v]&(1LL<<i)) dp[v][1]=1;
    else dp[v][0]=1;
    for(auto nv:G[v]){
      if(nv==p) continue;
      f(f,nv,v,i);
      ll t0=dp[v][0],t1=dp[v][1];
      dp[v][0]=(t0*(dp[nv][0]+dp[nv][1])%MOD+t1*dp[nv][1]%MOD)%MOD;
      dp[v][1]=(t1*(dp[nv][0]+dp[nv][1])%MOD+t0*dp[nv][1]%MOD)%MOD;
    }
  };
  
  ll ans=0;
  rep(i,30){
    rep(j,100100) rep(k,2) dp[j][k]=0;
    f(f,0,-1,i);
    ans=(ans+dp[0][1]*B[i]%MOD)%MOD;
  }
  cout<<ans<<endl;

  return 0;
}