Laskettelukeskus

n = int(input())
graph = [[]for i in range(n+1)]
for i in range(n-1):
  j, r  = map(int,input().split())
  graph[j].append(r)
l = list(map(int,input().split()))
leafs = []
for i in range(1,n+1):
    if len(graph[i])==0:
        leafs.append(i)
def go_up(l,graph,leaf,leafs):
    r = []
    i = leaf
    while i>2:
        for se in range(1,len(graph)):
            if i in graph[se]:
                i = se
                l[i-1]-=l[leaf-1]
                break
    l[leaf-1]=0

def f(l,graph,leafs):
    for leaf in leafs:
        if leaf>0:
            l[0]-=l[leaf-1]
            go_up(l,graph,leaf,leafs)
    leafs1=[]
    for r in leafs:
        for j in range(1,len(graph)):
            if r in graph[j] and len(graph[j])==1 and l[r-1]>0:
                leafs1.append(j)
                break
    leafs=list(set(leafs1))
    if len(leafs)>0:
        f(l,graph,leafs)
    return abs(l[0])
print(f(l,graph,leafs))

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED