Royal Highway

You are given a weighted tree with n nodes. The edges are numbered from 1 to n-1 in input order.
Then q operations follow:

- 1 id w : change the weight of edge id to w
- 2 u v : print the maximum edge weight on the simple path from u to v

Input
- The first line contains integer n.
- The next n-1 lines contain u v w.
- The next line contains q.
- The next q lines contain the operations.

Output
For each type 2 operation, print the answer.

If u = v, the path contains no edges and the answer is 0.

Constraints
- 2 <= n <= 200000
- 1 <= q <= 200000
- Edge weights fit in signed 32-bit integers.