Submission #66550691

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
n=int(input())
x=list(map(int,input().split()))
g=[[]for _ in range(n)]
for _ in range(n-1):
    u,v,w=map(int,input().split())
    u-=1
    v-=1
    g[u].append((v,w))
    g[v].append((u,w))
ans=0
def dfs(now,p):
    global ans
    tmp=x[now]
    for nxt,w in g[now]:
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
n=int(input())
x=list(map(int,input().split()))
g=[[]for _ in range(n)]

for _ in range(n-1):
    u,v,w=map(int,input().split())
    u-=1
    v-=1
    g[u].append((v,w))
    g[v].append((u,w))

ans=0

def dfs(now,p):
    global ans
    tmp=x[now]
    for nxt,w in g[now]:
        if nxt==p:continue
        res=dfs(nxt,now)
        ans+=abs(res)*w
        tmp+=res
    return tmp
dfs(0,-1)
print(ans)

Submission Info

Judge Result