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()))
l1 = l.copy()
l1[0]=0

def f(l,l1,graph):
    fr = 0
    i = 1
    while i<len(graph)-1:
        if graph[i][0]==i+1:
            i+=1
            continue
        else:
            fr = 1
            break
    if fr == 0:
        return max(l)

    for i in range(n,0,-1):
        le = len(graph[i])
        if le==0:
            continue
        else:
            for j in graph[i]:
                if l1[j-1]>=0:
                    l1[0]-=l1[j-1]
                    if i != 1:
                        l1[i-1]-=(l1[j-1])
                    l1[j-1]=0
    if abs(l1[0])<l[0]:
      return l[0]+(l[0]-abs(l1[0]))
    return abs(l1[0])
print(f(l,l1,graph))

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 37, in <module>
    print(...

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER