#include <bits/stdc++.h>
using namespace std;
const long long maxN = 3e5 + 13, mod = 1e9 + 7;
long long n, q, st[maxN], en[maxN], lvl[maxN], t;
vector<long long> adj[maxN];
void dfs(long long x) {
  st[x] = t++;
  for (auto a : adj[x]) {
    lvl[a] = lvl[x] + 1;
    dfs(a);
  }
  en[x] = t;
}
struct seg_tree {
  long long tree[maxN * 4], lzy[maxN * 4];
  void relax(long long l, long long r, long long indx) {
    if (lzy[indx]) {
      tree[indx] = (tree[indx] + lzy[indx]) % mod;
      if (r - l > 1) {
        lzy[indx << 1] = (lzy[indx << 1] + lzy[indx]) % mod;
        lzy[indx << 1 ^ 1] = (lzy[indx << 1 ^ 1] + lzy[indx]) % mod;
      }
      lzy[indx] = 0;
    }
  }
  void update(long long L, long long R, long long val, long long l = 0,
              long long r = n, long long indx = 1) {
    relax(l, r, indx);
    if (L <= l && r <= R) {
      lzy[indx] = (lzy[indx] + val) % mod;
      relax(l, r, indx);
      return;
    }
    if (R <= l || r <= L) return;
    long long mid = l + r >> 1;
    update(L, R, val, l, mid, indx << 1);
    update(L, R, val, mid, r, indx << 1 ^ 1);
    tree[indx] = (tree[indx << 1] + tree[indx << 1 ^ 1]) % mod;
  }
  long long get(long long L, long long R, long long l = 0, long long r = n,
                long long indx = 1) {
    relax(l, r, indx);
    if (L <= l && r <= R) {
      return tree[indx];
    }
    if (R <= l || r <= L) return 0;
    long long mid = l + r >> 1;
    return (get(L, R, l, mid, indx << 1) + get(L, R, mid, r, indx << 1 ^ 1)) %
           mod;
  }
} seg[5];
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 2; i <= n; i++) {
    long long p;
    cin >> p;
    adj[p].push_back(i);
  }
  lvl[1] = 1;
  dfs(1);
  cin >> q;
  while (q--) {
    long long t, v, x, k;
    cin >> t;
    if (t == 1) {
      cin >> v >> x >> k;
      seg[1].update(st[v], en[v], x + lvl[v] * k);
      seg[2].update(st[v], en[v], k);
    } else {
      cin >> v;
      cout << (((seg[1].get(st[v], st[v] + 1) -
                 ((1ll * seg[2].get(st[v], st[v] + 1) * lvl[v]) % mod)) %
                mod) +
               mod) %
                  mod
           << '\n';
    }
  }
}
