#include <bits/stdc++.h>
using namespace std;
long long int BIT[2][300005];
void update(int cs, int indx, long long int val) {
  while (indx < 300005) {
    BIT[cs][indx] += val;
    BIT[cs][indx] %= 1000000007;
    indx += (indx & -indx);
  }
}
int sum(int cs, int indx) {
  int ans = 0;
  while (indx != 0) {
    ans += BIT[cs][indx];
    ans %= 1000000007;
    indx -= (indx & -indx);
  }
  return ans;
}
int Time;
int P[300005];
int T[300005];
int D[300005];
int st[300005];
int en[300005];
vector<int> adj[300005];
void dfs(int u, int d) {
  st[u] = ++Time;
  D[u] = d;
  for (int i = 0; i < adj[u].size(); i++) dfs(adj[u][i], d + 1);
  en[u] = Time;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    scanf("%d", &P[i]);
    adj[P[i]].push_back(i);
  }
  dfs(1, 0);
  int q;
  scanf("%d", &q);
  for (int i = 1; i <= q; i++) {
    int cmd;
    scanf("%d", &cmd);
    if (cmd == 1) {
      int v;
      long long int x, k;
      scanf("%d %I64d %I64d", &v, &x, &k);
      long long int add = (x + D[v] * k) % 1000000007;
      update(0, st[v], add);
      update(0, en[v] + 1, 1000000007 - add);
      update(1, st[v], k);
      update(1, en[v] + 1, -k);
    } else {
      int v;
      scanf("%d", &v);
      long long int Ans = sum(0, st[v]);
      long long int Count = sum(1, st[v]);
      Ans -= (Count * D[v]) % 1000000007;
      Ans = (Ans + 1000000007) % 1000000007;
      printf("%I64d\n", Ans);
    }
  }
}
