Tietoverkko

from array import array

n = int(input())
graph = {}

s = 0
   

for _ in range(n-1):
    a, b, x = [int(e) for e in input().split()]
    if a in graph:
        graph[a][b] = x
    else:
        graph[a] = {b: x}
    if b in graph:
        graph[b][a] = x
    else:
        graph[b] = {a: x}




l = array('I', [])

def count(v, p):
    global s
    global graph
    global l

    length = len(l)
    d = {}
    for i in range(length):
        if l[i] > graph[v][p]:
            d[i] = l[i]
            l[i] = graph[v][p]

        
    if p > 0:
        l.append(graph[v][p])
        s += sum(l)

    
    for key in graph[v]:
        if key != p:
            count(key, v)

    for key in d:
        l[key] = d[key]

    current = len(l)
    if p > 0:
        for i in range(length + 1, len(l)):
            if l[i] > graph[v][p]:
                l[i] = graph[v][p]


count(1, 0)


print(s)


    

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED