Every season at the pine barrens of Needlepoint, someone must prepare the guildmaster's brief. This year the task falls to Zaid, armed only with the routes register. 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 <= 1498; 0 <= m <= 4494; 0 <= w <= 10.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1498; 0 <= m <= 4494; 0 <= w <= 10.
