The council of the maple sugarbush of Saprun pays by the answer, and Gita intends to earn it. First: the full register of corridors. 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 <= 1124; 0 <= m <= 3372; 0 <= w <= 1000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1124; 0 <= m <= 3372; 0 <= w <= 1000000.
