#include <bits/stdc++.h>
using namespace std;
long long xrange[4 * 300000 + 5];
long long krange[4 * 300000 + 5];
int depth[300000];
std::vector<int> children[300000];
int indexInRangeTree[300000 + 5], startRange[300000 + 5], endRange[300000 + 5];
int totId;
void compute_tree_ranges(int c, int h) {
  depth[c] = h;
  indexInRangeTree[c] = startRange[c] = totId++;
  for (int nxt : children[c]) {
    compute_tree_ranges(nxt, h + 1);
  }
  endRange[c] = totId;
}
void update(int uL, int uR, long long x, long long k, int v, int i = 1,
            int cLeft = 0, int cRight = 300000) {
  if (uL == cLeft && uR == cRight) {
    xrange[i] = (xrange[i] + x + ((depth[v] * k) % 1000000007)) % 1000000007;
    krange[i] = (krange[i] + k) % 1000000007;
    return;
  }
  int mid = (cLeft + cRight) / 2;
  if (uL < mid) update(uL, min(uR, mid), x, k, v, i * 2, cLeft, mid);
  if (uR > mid) update(max(uL, mid), uR, x, k, v, i * 2 + 1, mid, cRight);
}
long long query(int uL, int uR, int v, int acc_k = 0, int i = 1, int cLeft = 0,
                int cRight = 300000) {
  if (uL == cLeft && uR == cRight) {
    return ((xrange[i] % 1000000007) -
            (((depth[v] % 1000000007) *
              ((acc_k % 1000000007) + (krange[i] % 1000000007)) % 1000000007) %
             1000000007)) %
           1000000007;
  }
  int mid = (cLeft + cRight) / 2;
  long long ans = xrange[i];
  if (indexInRangeTree[v] < mid)
    ans = (ans + query(uL, min(uR, mid), v, (acc_k + krange[i]) % 1000000007,
                       i * 2, cLeft, mid) %
                     1000000007) %
          1000000007;
  else
    ans = (ans + query(max(uL, mid), uR, v, (acc_k + krange[i]) % 1000000007,
                       i * 2 + 1, mid, cRight) %
                     1000000007) %
          1000000007;
  return ans;
}
void update_node(int id, int x, int k) {
  update(startRange[id], endRange[id], x, k, id);
}
long long query_subtree(int id) {
  auto res = query(startRange[id], endRange[id], id);
  if (res < 0) {
    return 1000000007 + res;
  }
  return res;
}
int main(void) {
  std::ios::sync_with_stdio(false);
  int n, q, code, v, x, k;
  std::cin >> n;
  for (int i = 1; i < n; i++) {
    std::cin >> x;
    children[x - 1].push_back(i);
  }
  compute_tree_ranges(0, 0);
  std::cin >> q;
  for (int i = 0; i < q; i++) {
    std::cin >> code;
    if (code == 1) {
      std::cin >> v >> x >> k;
      update_node(v - 1, x, k);
    } else {
      std::cin >> v;
      std::cout << query_subtree(v - 1) << std::endl;
    }
  }
}
