Tietoverkko

n = int(input())
graph_dict = {i : [] for i in range(1, n+1)}
graph = []
for _ in range(n-1):
    inp = tuple(map(int, input().split()))
    graph.append(inp)
    graph_dict[inp[0]].append(inp[1])
    graph_dict[inp[1]].append(inp[0])



def search_main():
    s = 0

    graph.sort(key=lambda x: x[2])
    while len(graph) > 0:
        l,r = 1, 1
        m = graph[0]
        graph.pop(0)
        graph_dict[m[0]].remove(m[1])
        graph_dict[m[1]].remove(m[0])

        for n in graph_dict[m[0]]:
            l += search(n, [m[0]])
        
        for n in graph_dict[m[1]]:
            r += search(n, [m[1]])

        s += l*r * m[2]

    return s
        
def search(node, checked=[]):
    if len(list(filter(lambda x: x not in checked, graph_dict[node]))) == 0:
        return 1
    l = 0
    for n in graph_dict[node]:
        checked.append(n)
        l += search(n, checked)
    return l

print(search_main())

Test 1

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 45, in <module>
    print(...

Test 2

Group: 2, 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 45, in <module>
    print(...

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED