The dispatch writer Botanist has been asked to recover the missing manifest. On the desk lies a long table of canals readings. 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 <= 1803; 0 <= m <= 5409; 0 <= w <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1803; 0 <= m <= 5409; 0 <= w <= 1000.
