The first line contains a integer T$(1\leq T\leq 20)$, indicating there are T test cases followed.
For each test case, the first line contains one integers $n$: the number of nodes of the tree$(1\leq n\leq 200,000)$.
In the following $n-1$ lines, each line has three integers $u$,$v$ and $w$, indicating there exists a line between node $u$ and $v$, which length equals to $w$$(1\leq u,v\leq n,1\leq w\leq 200)$.
It is guaranteed that $(1\leq ∑n\leq 2,000,000)$.
$(1\leq T \leq 20)$
$(1\leq n\leq 200,000)$
$(1\leq u,v\leq n,1\leq w\leq 200)$
$(1\leq ∑n\leq 2000000)$