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的边。 输出：最小的任意两点间的距离和

1.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．