Laskettelukeskus

def calculate(current)
  children = $nodes[current]
  #puts "#{current}, #{children}"
  if children.empty?
    return $requireds[current - 1] # shift
  else
    t = 0
    children.each { |c| t += calculate(c) }
    return t
  end
end

count = gets.chomp.to_i
 
rows = []
(count - 1).times do
  rows << gets.chomp.split(" ").map(&:to_i)
end

$requireds = gets.chomp.split(" ").map(&:to_i)

$nodes = Hash.new { Array.new }

while rows.length > 0
  a, b = rows.shift
  $nodes[a] |= [b]
end
# hash stores parent
# parent through child until child has no child, then take thing and return with alg
puts calculate(1)

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: RUNTIME ERROR

input/code.rb:8:in `each': stack level too deep (SystemStackError)
	from input/code.rb:8:i...

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED