You are given a rooted tree consisting of *n* vertices numbered from 1 to *n*. The root of the tree is a vertex number 1.

Initially all vertices contain number 0. Then come *q* queries, each query has one of the two types:
 -  The format of the query: 1 *v* *x* *k*. In response to the query, you need to add to the number at vertex *v* number *x*; to the numbers at the descendants of vertex *v* at distance 1, add *x* - *k*; and so on, to the numbers written in the descendants of vertex *v* at distance *i*, you need to add *x* - (*i*·*k*). The distance between two vertices is the number of edges in the shortest path between these vertices. -  The format of the query: 2 *v*. In reply to the query you should print the number written in vertex *v* modulo 1000000007 (10<sup class="upper-index">9</sup> + 7). 
Process the queries given in the input.
The first line contains integer *n* (1 ≤ *n* ≤ 3·10<sup class="upper-index">5</sup>) — the number of vertices in the tree. The second line contains *n* - 1 integers *p*<sub class="lower-index">2</sub>, *p*<sub class="lower-index">3</sub>, ... *p*<sub class="lower-index">*n*</sub> (1 ≤ *p*<sub class="lower-index">*i*</sub> &lt; *i*), where *p*<sub class="lower-index">*i*</sub> is the number of the vertex that is the parent of vertex *i* in the tree.

The third line contains integer *q* (1 ≤ *q* ≤ 3·10<sup class="upper-index">5</sup>) — the number of queries. Next *q* lines contain the queries, one per line. The first number in the line is *type*. It represents the type of the query. If *type* = 1, then next follow space-separated integers *v*, *x*, *k* (1 ≤ *v* ≤ *n*; 0 ≤ *x* &lt; 10<sup class="upper-index">9</sup> + 7; 0 ≤ *k* &lt; 10<sup class="upper-index">9</sup> + 7). If *type* = 2, then next follows integer *v* (1 ≤ *v* ≤ *n*) — the vertex where you need to find the value of the number.
class cell(object):
    def __init__(self, Root, layer):
        self.Root = Root
        self.layer = layer
        self.num = 0
        self.descendants = []
    def rec(self, m, v, x, k):
        self.num += x - k * (self.layer - m[v].layer)
        for i in self.descendants:
            m[i].rec(m, v, x, k)


n = int(input())
m = dict()


inp1 = list(map(int, input().split(' ')))
m[1] = cell(1, 0)
b = 2
for i in inp1:
    m[b] = cell(i, m[i].layer + 1)
    m[i].descendants.append(b)
    b += 1

    
##for i in m:
##    print (i, m[i].Root, m[i].layer, m[i].num, m[i].descendants)
##print('')

    
q = int(input())
for i in range(q):
    inp = list(map(int, input().split(' ')))
    if inp[0] == 1:
        v, x, k = inp[1], inp[2], inp[3]
        m[v].rec(m, v, x, k)

        
##        for i in m:
##            print (i, m[i].Root, m[i].layer, m[i].num, m[i].descendants)
##        print('')

            
    elif inp[0] == 2:
        print(m[inp[1]].num % 1000000007)

        
##        for i in m:
##            print (i, m[i].Root, m[i].layer, m[i].num, m[i].descendants)
##        print('')


##for i in m:
##    print (i, m[i].Root, m[i].layer, m[i].descendants)
