Laskettelukeskus

import sys
d = {}
cd = {}

def solmu(i, s):
    k = 0
    if(i not in d):
        return cd[i-1]
    
    for j in d[i]:
        k += solmu(j, s)
    s = max(cd[i-1], k)
    return s


def main():
    sys.setrecursionlimit(int(1e5)+10)
    n = int(input())

    for i in range(n-1):
        a,b = (int(x) for x in input().split())
        if(a not in d.keys()):
            d[a] = [b]
        else:
            d[a].append(b)
    for i,x in enumerate(input().split()):
        cd[i] = int(x)
    # print(d)
    # print("AAAA")
    # print(cd)
    # print("BBBB")
    print(solmu(1, 0))
main()

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