The Q queries can be of the following two types :

• \(1\space v\space x\) : Update \(A[v] = x\). Note that updates are permanent.
• \(2\space v\) : Initialize \(vis[u] = 0 \space \forall \space u \in [1,N]\). Run the above algorithm with call dfs(1,-1). Compute the sum \(\large\displaystyle \sum_{u \in Subtree\space of\space v}^v vis[u]\). As the result may be quite large print it \(mod\space 10^9+7\)

INPUT
The first line contains two integers N and Q, the number of vertices in the tree and the number of queries respectively.
Next \(N-1\) lines contains the undirected edges of the tree.
The next lines contains N integers denoting the elements of array A.
Following Q lines describe the queries.

OUTPUT
For each query of type 2, print the required result \(mod\space 10^9+7\).

CONSTRAINT
\(1 ≤ N, Q ≤ 10^5\)
\(1 ≤ A[v],\space x ≤ 10^9\)
\(1 ≤ v ≤ N\)