N=int(input())
D=[[] for _ in range(N)]
for i in range(N-1):
  x,y=map(int, input().split())
  x-=1;y-=1
  D[x].append(y);D[y].append(x)
B=list(map(int, input().split()))
mod=10**9+7

E=[-1]*N
E[0]=0
from collections import deque
d=deque()
d.append(0)
F={};FF=[];P=[-1]*N
while d:
  now=d.popleft()
  for nex in D[now]:
    if E[nex]==-1:
      E[nex]=E[now]+1
      v=E[nex]
      d.append(nex)
      P[nex]=now
      if v not in F:
        F[v]=[]
        FF.append(v)
      F[v].append(nex)

FF=sorted(FF)[::-1]
ans=0
for b in range(30):
  dp=[[0]*2 for _ in range(N)]
  for i in range(N):
    if (B[i]&(1<<b)):
      dp[i][1]=1
    else:
      dp[i][0]=1

  for f in FF:
    for now in F[f]:
      p=P[now]
      dpnew=[0,0]
      dpnew[0]+=dp[p][0]*dp[now][1]
      dpnew[1]+=dp[p][1]*dp[now][1]
      
      dpnew[0]+=dp[p][0]*dp[now][0]
      dpnew[0]+=dp[p][1]*dp[now][1]
      dpnew[1]+=dp[p][1]*dp[now][0]
      dpnew[1]+=dp[p][0]*dp[now][1]
      dpnew[0]%=mod 
      dpnew[1]%=mod
      dp[p]=dpnew
  d=dp[0][1]%mod 
  ans+=pow(2,b,mod)*d
  ans%=mod 
print(ans)