import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
edge = [[] for _ in range(N)]
for i in range(N-1):
  a,b = map(int, input().split())
  edge[a-1].append(b-1)
  edge[b-1].append(a-1)

# def dfs1(v, p):
#   if p>=0 and len(edge[v])==1:
#     offs, ons = max(A[v],0), max(A[v],B[v]+B[p])
#     return offs, ons 
#   offs, ons = A[v],0
#   for u in edge[v]:
#     if u!=p:
#       off, on = dfs1(u, v)
#       offs += off
#       ons += on
#   if p==-1:
#     return offs, ons
#   return max(offs,ons),max(offs,ons+B[v]+B[p])
def dfs2(start):
  stack = [start]
  parent = [N]*N
  parent[start] = -1
  offs = A[:]
  ons = [0]*N
  while stack:
    v = stack[-1]
    marker = 0
    for u in edge[v]:
      if u==parent[v]:
        continue
      if parent[u]==N: #前半
        marker = 1
        parent[u]=v
        stack.append(u)
      else: #後半
        offs[v] += offs[u]
        ons[v] += ons[u]
    if marker==0: #後半だったら
      stack.pop()
      if v==start:
        continue
      offs[v], ons[v] = max(offs[v],ons[v]), max(offs[v],ons[v]+B[v]+B[parent[v]])
  return offs[0], ons[0]

off2, on2 = dfs2(0)
print(max(off2,on2))