It is audit day at the temple city of Sunspire. Keeper spreads the corridors records across the table and picks up a sharp pencil. 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 <= 2139; 0 <= m <= 6417; 0 <= w <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 2139; 0 <= m <= 6417; 0 <= w <= 10.
