算法：最小生成树-模板+例题+（prim代码模板）

例题：
There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.

有N个村庄，编号从1到N，你应该建造一些道路，使每两个村庄可以相互连接。我们说两个村A和B是相连的，当且仅当A和B之间有一条道路，或者存在一个村C以便在A和C之间有一条道路，并且C和B相连。

We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.

我们知道一些村庄之间已经有一些道路，你的工作就是修建一些道路，使所有村庄都连通起来，所有道路的长度都是最小的。我们知道一些村庄之间已经有一些道路，你的工作就是修建一些道路，使所有村庄都连通起来，所有道路的长度都是最小的。

Input
The first line is an integer N (3 <= N <= 100), which is the number of villag