C - Edge Elimination

You're given a tree (a simple connected acyclic graph) on $n$ vertices. The $i$-th edge of the tree is between vertices $u_i$ and $v_i$, and has the value $w_i$ written on it. Initially, your score is $0$. You can repeatedly perform the following operation: - Choose an edge $(u, v, w)$ that exists in the tree. This is an edge between $u$ and $v$ with a value of $w$. - Add its value $w$ to yo