Laskettelukeskus

import sys
sys.setrecursionlimit(100100)
 
 
def mapper(values, parents, auraukset):
    new_l = {}
    
    vals = 0
    for p in values:
        if(p in parents):
            res = mapper(parents[p], parents, auraukset)
            new_l[p] = res[0], max(auraukset[p-1], res[1])
            vals = res[1]
        else:
            new_l[p] = (0, auraukset[p-1])
 
    return new_l, max(vals, sum([v[1] for v in new_l.values()]))
 
n = int(input())
rinteet = [input().split() for _ in range(n)]
rinteet = [[int(r) for r in re] for re in rinteet]
auraukset = rinteet[-1]
rinteet = rinteet[:-1]
 
parents = {}
for r in rinteet:
    if(r[0] not in parents.keys()):
        parents[r[0]] = []
    parents[r[0]] += [r[1]]
 
 
rinnemap = mapper(parents[1], parents, auraukset)
 
print(int(rinnemap[1]))
 

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: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

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: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED