LWDB

The Large Wood Database (LWDB) stores any existing tree and paints it securely. The update adds new functionality, so the graph theory behind it needs another look. A weighted tree is stored in LWDB. The LWDB Management System (LWDB MS) accepts two query types:

1. 1 v d c: paint every tree vertex whose distance from vertex $v$ is at most $d$ with color $c$. Every vertex starts with color $0$.
2. 2 v: return the color of vertex $v$.

You need to prototype LWDB MS and answer all user queries.

The first line contains $N$ ($1 \le N \le 10^5$), the number of tree vertices. Each of the next $N-1$ lines contains three integers $a_i$, $b_i$, $w_i$ ($1 \le a_i, b_i \le N$, $a_i \ne b_i$, $1 \le w_i \le 10^4$), meaning branch $i$ connects vertices $a_i$ and $b_i$ with weight $w_i$. The next line contains $Q$ ($1 \le Q \le 10^5$), the number of queries. Each of the next $Q$ lines is one of the following:

1. 1 v d c ($1 \le v \le N$, $0 \le d \le 10^9$, $0 \le c \le 10^9$)
2. 2 v ($1 \le v \le N$)

For each query of type 2, print the color of the requested vertex on its own line.