MOD = 998244353
n = int(input())
g = [[] for _ in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    g[a - 1].append(b - 1)
    g[b - 1].append(a - 1)
a = list(map(int, input().split()))
ans = 0
for k in range(30):
    seen = [False] * n
    seen[0] = True
    child = [[] for _ in range(n)]
    stk = [~0, 0]
    dp0 = [0] * n
    dp1 = [0] * n
    while stk:
        u = stk.pop()
        if u >= 0:
            for v in g[u]:
                if seen[v]:
                    continue
                seen[v] = True
                child[u].append(v)
                stk.append(~v)
                stk.append(v)
        else:
            u = ~u
            if a[u] >> k & 1:
                dp1[u] = 1
            else:
                dp0[u] = 1
            for v in child[u]:
                dp0[u], dp1[u] = dp0[u]*dp0[v] + dp1[u]*dp1[v] + dp0[u]*dp1[v], dp0[u]*dp1[v] + dp1[u]*dp0[v] + dp1[u]*dp1[v]
                dp0[u] %= MOD
                dp1[u] %= MOD
    ans += dp1[0] << k
ans %= MOD
print(ans)