Python Programming Problem:

Given a weighted undirected graph G(V,E), where all edges eE are undirected edges connecting nodes ue and ve, with weights we. Please find a subset E E such that G (V,E ) forms a connected graph, and the total sum of weights for E , denoted as s=eE we, is minimized. Output this minimum value s.

Input Description:

For each set of test cases, the first line consists of a positive integer T(1T10), indicating that there are T test cases following.

Each test case contains several lines. The first line contains two positive integers n(1n2000) and m(1m4000), indicating that the graph G has n vertices and m edges. Following this are m lines, each containing 3 integers u,v,w(0u, v<n, 1w10000), representing all edges in set E. The numbering of vertices starts from 00 to n1.

HERE IS JUST AN EXAMPLE OF THE CORRECT ANSWER sample input 3 3 2 0 1 2 1 2 3 3 3 0 1 1 1 2 3 2 0 1 3 1 0 1 2 sample output 5 2 -1