The first line contains three positive integers $$$n_1$$$, $$$n_2$$$, and $$$m$$$ ($$$1\le n_1,n_2,m \le 1\times 10^5$$$), separated by a space, representing the length of $$$A$$$, the total number of points in $$$T$$$, and the number of inquiries and operations.

The next $$$n_1$$$ lines, the $$$i$$$-th line contains three integers $$$u_i$$$, $$$v_i$$$, and $$$x_i$$$ ($$$1\le u_i,v_i\le n_2, 1\le x_i\le 1\times 10^2$$$), separated by a space, representing the operation $$$A_i$$$ as "add $$$x_i$$$ to all point weights on the simple path from $$$u_i$$$ to $$$v_i$$$ in $$$T$$$."

Next, there are $$$n_2-1$$$ lines, each containing two positive integers $$$u$$$ and $$$v$$$ ($$$1\le u,v \le n_2$$$), separated by a space, representing an edge of the tree. It is guaranteed that the $$$n_2-1$$$ edges form a tree.

Next, there are $$$m$$$ lines. The first number $$$op$$$ ($$$op\in \{1,2,3\}$$$) in each line indicates the operation number, followed by:

• If $$$op$$$ is $$$1$$$, it is followed by two positive integers $$$l$$$ and $$$r$$$ ($$$1\le l\le r\le n_1$$$), separated by a space, indicating that the operations of $$$A_l, A_{l+1} \dots A_r$$$ are executed in sequence;
• If $$$op$$$ is $$$2$$$, it is followed by a positive integer $$$x$$$ ($$$1\le x\le n_2$$$), indicating that the sum of the subtrees of $$$T$$$ with $$$x$$$ as the root is queried;
• If $$$op$$$ is $$$3$$$, it is followed by a positive integer $$$y$$$ ($$$1\le y\le n_2$$$), indicating that the root of $$$T$$$ is changed to $$$y$$$ (If the current root is $$$y$$$, no operation will be performed).