Laskettelukeskus

class TreeNode:
  def __init__(self, value, number=None):
      self.value = value
      self.number = number
      self.children = []

def build_tree(nodes_with_numbers):
  node_dict = {}
  for parent_value, child_value, number in nodes_with_numbers:
      parent_node = node_dict.get(parent_value, TreeNode(parent_value))
      child_node = node_dict.get(child_value, TreeNode(child_value))
      child_node.number = number
      parent_node.children.append(child_node)
      node_dict[parent_value] = parent_node
      node_dict[child_value] = child_node
  return node_dict


def fln(node):
  if not node or not node.children:
      return 0, 0
  ll= max(child.number for child in node.children if child.number is not None)
  lr = 0
  for child in node.children:
      if child.number != ll:
          lr = max(lr, child.number)
  return ll, lr


n = int(input())
nodes_with_numbers = []
nr = []
for i in range(n-1):
  r, l = map(int,input().split())
  nr.append((r,l))
s = list(map(int,input().split()))
for i in range(n-1):
  nodes_with_numbers.append((nr[i][0],nr[i][1],s[i+1]))


tree_nodes = build_tree(nodes_with_numbers)
largest_left, largest_right = fln(tree_nodes[1])
sum_of_largest_numbers = largest_left + largest_right
print(sum_of_largest_numbers)

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: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER