Description: Given a right to unrooted tree, modify any one side (you can not modify), the number of required minimum distance between any two points and is? Modify an edge means an edge to delete the tree, then the two endpoints of the connection, the formation of a new class of trees, and does not change the weight of this edge, in this tree, based on the minimum requirements of any two the distance between the points and how much distance between any two points and means: sum (a b distance, a <b,a和b都是树上的点)
输入：第一行是整数n，接下来n-1行，每行包括3个整数ai,bi,wi,表示节点ai与bi之间有一条权重为wi的边。
输出：最小的任意两点间的距离和
To Search:
File list (Check if you may need any files):
1.txt
Download