华南理工大学“三七互娱杯”程序设计竞赛（重现赛）G HRY and tree

链接：https://ac.nowcoder.com/acm/contest/874/G
来源：牛客网
 

题目描述

In 9102, HRY was elected as the director of the GDCPC Metro Bureau. In his work, he needs to use his knowledge to solve some problems.
The subway line of GDCPC can be regarded as a connected graph composed of n points and n-1 edges. The edge weight represents the distance between two points. The weight of the path between two different points is defined as the maximum value of the edge weights of all edges on the simple path between them. Now HRY needs to know the sum of the weights of all pairs of points (obviously there are C2nCn2 kinds), because he is busy, so he wants you, a JBer, to helped him calculate it.

输入描述:

The first line of the input file contains a positive integer T, indicating the number of test cases.
Each case has n lines. The first line is a positive integer n, indicat