1107:Change

There is a rooted tree with n nodes, number from 1-n. Root’s number is 1.Each node has a value a_i.

Initially all the node’s value is 0.

We have q operations. There are two kinds of operations.

1 v x k : a[v]+=x , a[v’]+=x-k (v’ is child of v) , a[v’’]+=x-2*k (v’’ is child of v’) and so on.

2 v : Output a[v] mod 1000000007(10⁹ + 7).

First line contains an integer T (1 ≤ T ≤ 3), represents there are T test cases.

In each test case:

The first line contains a number n.

      The second line contains n-1 number, p₂,p₃,…,p_n . p_i is the father of i.

      The third line contains a number q.

      Next q lines, each line contains an operation. (“1 v x k”  or  “2 v”)

1 ≤ n ≤ 3·10⁵

1 ≤ p_i< i

1 ≤ q ≤ 3·10⁵

1 ≤ v ≤ n; 0 ≤ x < 10⁹+ 7; 0 ≤ k < 10⁹ + 7

For each operation 2, outputs the answer.

1

3

1 1

3

1 1 2 1

2 1

2 2

2

1