Laskettelukeskus

import sys
from functools import lru_cache

sys.setrecursionlimit(100000000)

def main():
    n = int(input())
    leafs = []
    for i in range(n):
        leafs.append([])

    for i in range(n - 1):
        a, b = [int(el) for el in input().split()]
        leafs[a - 1].append(b)

    prices = [int(el) for el in input().split()]
    print(get_num_slopes(0, leafs, prices))


#@lru_cache(maxsize= 1000000000)
def get_num_slopes(slope, leafs, prices):
    if not leafs[slope]:
        return prices[slope]
    else:
        s = 0
        for new_slope in leafs[slope]:
            s += get_num_slopes(new_slope - 1, leafs, prices)
        return max(prices[slope], s)
    
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