Laskettelukeskus

class Tree:
    def __init__(self, value=None, children=None):
        self.value = value
        self.children = []
        if children is not None:
            self.child(children)
    
    def child(self, children):
        for i in children:
            self.children.append(i)
        
    def __str__(self):
        return "...".join([str(i.value) for i in self.children])
            
    def go_deep_loop(self, root, nodes):
        
        visited = {key:False for key in nodes}
        Q = []
        Q.append(root)
        visited[root] = True
        summa  = 0
        temp = 0
        while Q != []:
            v = Q.pop(0)
            for w in v.children:
                if visited[w] != True:
                    temp += w.value
                    Q.append(w)
                    # visited[w]=True
            if temp>v.value:
                v.value = temp 
                Q.append(v)
            temp = 0
                
            # if v.children == []:
            #     temp = v.value
        return root.value

            
            
        
        # return summa
        
        # def temp(self, node):
        #     summa = 0
        #     if root.children == []:
        #         return node.value
        #     if root.children != []:
        #         temp = 0
        #         for i in node.children:
        #             temp += i.value
        #     if temp >
        # while True:
            
        #     for i in root.children:           
        #         summa += temp(i)
        
    def go_deep(self, root):
        if root.children == []:
            # print("leaf", root.value)
            return root.value
        if root.children != []:
            summa = 0
            for i in root.children:   
                summa += self.go_deep(i)
        if summa < root.value:      
            return root.value
        return summa


# def stupid():
#     amount = int(input())
#     rinteet = {key:[] for key in range(1, amount+1)}
#     for i in range(amount-1):
#         edge = input().split()
#         rinteet[int(edge[0])].append(edge[1])
#     leafs = [i[0] for i in rinteet.items() if i[1]==[]]
#     values = input().split()
#     summa = 0
#     for i in leafs:
#         summa+=int(values[i-1])
#     # print(leafs)
#     print(summa)
           
# stupid()     

amount = int(input())
rinteet = [Tree() for x in range(amount)]
for i in range(amount-1):
    edge = input().split()
    rinteet[int(edge[0])-1].child([rinteet[int(edge[1])-1]])
values = input().split()
# print(values)
for i, v in enumerate(values):
    rinteet[i].value = int(v)
# for i in rinteet:
#     print(i.value, i)

# amount = 10
# values = [0, 2, 4, 3, 1, 3, 1, 5, 3, 4]
# edges = [(1, 2), (1, 3), (2, 4), (2, 5), (3, 6), (3, 7), (4, 8), (6, 9), (6, 10)]
# rinteet = [Tree(value) for value in values]
# for edge in edges:
#     rinteet[int(edge[0])-1].child([rinteet[int(edge[1])-1]])
    
print(rinteet[0].go_deep_loop(rinteet[0], rinteet))
    



# t = Tree(0)
# t.child([Tree(2), Tree(4, [Tree(3, [Tree(3), Tree(4)]), Tree(1)])])
# print(t.children)
# print(t.go_deep(t))

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

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED