Shepherd runs the bakery at the steppe camp of Horselord Plains. Today the books show a list of routes, and the numbers must be worked out before sundown. 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 <= 1457; 0 <= m <= 4371; 0 <= w <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1457; 0 <= m <= 4371; 0 <= w <= 10.
