cheap_town_trip_Kruskal

def find_root(parent, node):
    while node != parent[node]:
        node = parent[node]
    return node


nodes = int(input())
edges = int(input())

graph = []

for _ in range(edges):
    first, second, weight = [ int(x) for x in input().split(' - ')]
    graph.append((first, second, weight))

parent = [num for num in range(nodes)]
total_cost = 0




for first, second, weight in sorted(graph, key=lambda e: e[2]):
    first_node_root = find_root(parent, first)
    second_node_root = find_root(parent, second)

    if first_node_root == second_node_root:
        continue
    parent[first_node_root] = second_node_root
    total_cost += weight

print(f'Total cost: {total_cost}')