B-Tree Climber_2026牛客五一集训派对day5

时间限制：C/C++/Rust/Pascal 5秒，其他语言10秒
空间限制：C/C++/Rust/Pascal 1024 M，其他语言2048 M
64bit IO Format: %lld

题目描述

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,x$ , which means you need to find the smallest connected component in the tree that contains all nodes in the range $[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 .
The following  lines each contain two integers  representing that there's an edge between  and  on the tree.
The following $m$ lines each contains three integers  representing an operation.

输出描述:

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

示例1

输入

复制

输出

复制

说明

For the first operation, the smallest connected component contains vertices .
For the second operation, the smallest connected component contains vertices .
For the third operation, the smallest connected component contains vertices .

备注:

, ,  , , .