Submission #66564535

---

Source Code Expand

import sys

sys.setrecursionlimit(10**7)


def find_min_energy(N, x, graph):
    def dfs(u, p):
        count = x[u]
        cost = 0

        for v, w in graph[u]:
            if v == p:
                continue
            s_count, s_cost = dfs(v, u)
            count += s_count
            cost += s_cost + abs(s_count) * w

        return count, cost

    _, cost = dfs(0, 0)

    return cost


N = int(input())
x = [int(i) for i in input().split()]
graph = [[] for _ in range(N)]
for _ in range(N - 1):
    u, v, w = map(int, input().split())
    u -= 1
    v -= 1
    graph[u].append((v, w))
    graph[v].append((u, w))

print(find_min_energy(N, x, graph))

Submission Info

Judge Result