import sys
from collections import deque
input = sys.stdin.readline
mod = 998244353

N = int(input())
adj = [[] for _ in range(N+1)]
for _ in range(N-1):
    a, b = map(int, input().split())
    adj[a].append(b)
    adj[b].append(a)
A_ori = [0] + list(map(int, input().split()))

que = deque()
que.append(1)
seen = [-1] * (N+1)
seen[1] = 0
par = [0] * (N+1)
child = [[] for _ in range(N+1)]
seq = []
while que:
    v = que.popleft()
    seq.append(v)
    for u in adj[v]:
        if seen[u] == -1:
            seen[u] = seen[v] + 1
            par[u] = v
            child[v].append(u)
            que.append(u)
seq.reverse()

ans = 0
for lv in range(30):
    A = [a >> lv & 1 for a in A_ori]
    dp0 = [0] * (N + 1)
    dp1 = [0] * (N + 1)
    for v in seq:
        dp0_v = dp1_v = 0
        if A[v] == 0:
            dp0_v = 1
        else:
            dp1_v = 1
        for u in child[v]:
            dp0_v_new = ((dp0_v * dp0[u]) % mod + (dp0_v * dp1[u] + dp1_v * dp1[u]) % mod) % mod
            dp1_v_new = ((dp1_v * dp0[u]) % mod + (dp1_v * dp1[u] + dp0_v * dp1[u]) % mod) % mod
            dp0_v = dp0_v_new
            dp1_v = dp1_v_new

        dp0[v] = dp0_v
        dp1[v] = dp1_v
    ans = (ans + (dp1[1] * pow(2, lv, mod)) % mod) % mod
print(ans)