Clerk inherited the stall at the pine barrens of Needlepoint along with its curious bookkeeping system for routes. Time to make sense of it. 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 <= 856; 0 <= m <= 2568; 0 <= w <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 856; 0 <= m <= 2568; 0 <= w <= 1000000.
