#include <bits/stdc++.h>
using namespace std;
const int N = 300005;
const int MOD = 1000000007;
int n, m;
int it[2][N * 4], lazy[2][N * 4], T[N], pos[N], H[N];
vector<int> adj[N];
void dfs(int u, int pa) {
  int L = 1000000000;
  H[u] = H[pa] + 1;
  for (int i = 0; i < (int)adj[u].size(); ++i) {
    int v = adj[u][i];
    if (v == pa) continue;
    dfs(v, u);
    L = min(L, T[v]);
  }
  ++m;
  pos[u] = m;
  T[u] = min(m, L);
}
void lazy_update(int type, int p, int l, int r) {
  if (lazy[type][p] != 0) {
    if (l == r)
      it[type][p] = (it[type][p] + lazy[type][p]) % MOD;
    else {
      lazy[type][p * 2] = (lazy[type][p * 2] + lazy[type][p]) % MOD;
      lazy[type][p * 2 + 1] = (lazy[type][p * 2 + 1] + lazy[type][p]) % MOD;
    }
    lazy[type][p] = 0;
  }
}
void update(int type, int p, int l, int r, int u, int v, int k) {
  lazy_update(type, p, l, r);
  if (l > v || r < u) return;
  if (l >= u && r <= v) {
    lazy[type][p] = (lazy[type][p] + k) % MOD;
    lazy_update(type, p, l, r);
    return;
  }
  int m = (l + r) >> 1;
  update(type, p * 2, l, m, u, v, k);
  update(type, p * 2 + 1, m + 1, r, u, v, k);
}
int retrieve(int type, int p, int l, int r, int u) {
  lazy_update(type, p, l, r);
  if (l > u || r < u) return 0;
  if (l == r) return it[type][p];
  int m = (l + r) >> 1;
  int q1 = retrieve(type, p * 2, l, m, u),
      q2 = retrieve(type, p * 2 + 1, m + 1, r, u);
  return (q1 + q2) % MOD;
}
int main() {
  scanf("%d", &n);
  for (int i = 2; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    adj[x].push_back(i);
    adj[i].push_back(x);
  }
  dfs(1, 0);
  int q;
  scanf("%d", &q);
  while (q--) {
    int t;
    scanf("%d", &t);
    if (t == 1) {
      int v, x, k;
      scanf("%d%d%d", &v, &x, &k);
      update(0, 1, 1, n, T[v], pos[v], (x + (long long)k * H[v] % MOD) % MOD);
      update(1, 1, 1, n, T[v], pos[v], k);
    } else {
      int v;
      scanf("%d", &v);
      int res = (retrieve(0, 1, 1, n, pos[v]) -
                 (long long)retrieve(1, 1, 1, n, pos[v]) * H[v] % MOD) %
                MOD;
      if (res < 0) res += MOD;
      printf("%d\n", res);
    }
  }
  return 0;
}
