Font Style: Aa Aa Aa

求一个无向连通图中最小生成树的边权和.

Input



第一行是2个整数,分别表示顶点个数n和边数m。接下来的m行中,每一行第一个整

数表示边的开始顶点，第二个表示边的结束顶点，第三个表示这条边的权重。



测试数据中保证图是连通图,且没有自环；

两个顶点之间只有一条边；

n<=10000 m<=100000；

所有数据都是int可保存的.

Output



最小生成树的边权和-Font Style: Aa Aa Aa seeking a right to the edge of the minimum spanning tree and undirected connected graph Input The first line is the two integers represent the number of vertices n and the number of edges m. The next m rows, each row of the first integer represents a section of the starting vertex, the vertex of the end section of the second means, the third means that the weights of this section. Test data to ensure that the connected graph, and no self-loop　only an edge between two vertices　n < = 10000　m < = 100000　All data can be stored int Output minimum spanning tree edge weight and