Laskettelukeskus

from collections import defaultdict
import sys
input = sys.stdin.readline

def dfs(node, graph, counts, visited):
    visited[node] = True
    plows = 0
    
    for child in graph[node]:
        if not visited[child]:
            plows += dfs(child, graph, counts, visited)
    
    while counts[node - 1] > 1:
        plows += 1
        counts[node - 1] -= 1
    
    return plows

n = int(input().strip())
paths = [tuple(map(int, input().split())) for _ in range(n-1)]
counts = list(map(int, input().split()))

graph = defaultdict(list)
for a, b in paths:
    graph[a].append(b)
    graph[b].append(a)
visited = [False] * (n + 1)

result = dfs(1, graph, counts, visited)
print(result)

Test 1

Group: 1, 2

Verdict: ACCEPTED

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

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: RUNTIME ERROR

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

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