Caravans arrive at the obsidian flows of Blackglass with crates of roads, and Petr the dispatch writer must account for every last one. Task: Print the minimum total weight of a spanning tree, or -1 if the graph is not connected. Input format: First line: n and m. Next m lines: u v w. Output format: Print the MST weight or -1. Constraints: 1 <= n <= 1019; 0 <= m <= 3057; 0 <= w <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1019; 0 <= m <= 3057; 0 <= w <= 10.
