Laskettelukeskus

n = int(input())
graph = [[]for i in range(n+1)]
up = [[]for i in range(n+1)]
leafs = []
for i in range(n-1):
  j, r  = map(int,input().split())
  if j not in leafs and j!=1:
      leafs.append(j)
  elif r not in leafs and r!=1:
      leafs.append(r)
  graph[j].append(r)
  up[r].append(j)
l = list(map(int,input().split()))
l1=l[0]
l[0]=0

def go_up(leaf):
    la = l[leaf-1]
    if la<0:
        return
    st = leaf
    l[leaf-1]=0
    while st!=1:
        st=up[st][0]
        l[st-1]-=la

while len(leafs)!=0:
    for leaf in leafs:
        if graph[leaf]==[]:
            go_up(leaf)
            leafs.remove(leaf)
            graph[up[leaf][0]].remove(leaf)
print(max(abs(l[0]),l1))

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED