求一个连通无向图的最小生成树的代价（图边权值为正整数）。-Seeking a communication cost of the minimum spanning tree of undirected graph (Figure right side is a positive integer).