Tietoverkko

n=int(input())
 
total_nconn = n * (n-1)
conn = [dict()] * n
 
for i in range(0, n-1):
    c1, c2, sp = map(int, input().split())
    c1 -= 1
    c2 -= 1
    conn[c1][c2] = sp
    conn[c2][c1] = sp
 
s=0
 
def find_connection(c1, c2):
    while not c2 in conn[c1].keys():
        if c2 in conn[oth].keys():
            conn[c1][c2] = conn[oth][c2]
            conn[c2][c1] = conn[oth][c2]
        for oth in conn[c1].keys():
            find_connection(oth, c2)
    return conn[c1][c2]
    
 
for c in range(0, n-1):
    for o in range(c, n-1):
        s += find_connection(c, o)
        
print(s)
 
 

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED