问题 B: Tree Climber

链接：https://ac.nowcoder.com/acm/contest/57361/B
来源：牛客网
Given a rooted tree with $n$ nodes. Each edge has a weight and initially all weights are $0$.
You need to perform $m$ operations. In each operation you are given three integers l,r,xl,r,xl,r,x, which means you need to find the smallest connected component in the tree that contains all nodes in the range [l,r][l,r][l,r], and add $x$ to the weights of edges in this connected component.
After all operations are performed, output the weights of all edges.

The first line contains two integers $n,m$.
The following $n-1$ lines each contain two integers u,vu,vu,v representing that there's an edge between $u$ and $v$ on the tree.
The following $m$ lines each contains three integers l,r,xl,r,xl,r,x representing an operation.

Output $n-1$ lines. The $i$-th line contains an integer representing the final weight of the $i$-th edge in the input order.

6 3
1 2
1 3
2 4
2 5
5 6
3 5 1
4 6 10
1 2 100

101
1
11
11
10

For the first operation, the smallest connected component contains vertices 1,2,3,4,5.
For the second operation, the smallest connected component contains vertices 2,4,5,6.
For the third operation, the smallest connected component contains vertices 1,2.