#define _CRT_SECURE_NO_DEPRECATE
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>
#define mpair make_pair
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
const ld epsylon = 1e-9;

struct dat {
  int from, to;
  int idx;
  int qidx;
};

int get(const vector<int>& sums, int from, int to, int level) {
  int res = 0;

  if ( from > to )
  {
     return 0;
  }
  if (to < 0) {
    if (-to > level) {
      return 0;
    }

    return min(-from, level) - (-to) + 1;
  }
  if (to >= sums.size()) {
    to = (int)sums.size() - 1;
  }

  if ( from >= (int)sums.size()) {
    return 0;
  }

  if (from < 0 ) {
    if ( -from >= level) {
      res += level;
    } else {
      res += -from;
    }
    from = 0;
  }

  if (to == (int)sums.size() - 1) {
    return res + sums[from]; 
  } else {
    return res + sums[from] - sums[to + 1]; 
  }
}

int main()
{
  freopen("tree.in","r",stdin);
  freopen("tree.out", "w", stdout);

  int n;
  cin >> n;
  vector<int> dad(n);


  vector<vector<int> > sons(n);
  int root;
  for ( int i=0;i<n;++i){
    scanf("%d", &dad[i]);
    if(dad[i] != -1) {
      sons[dad[i] - 1].push_back(i);
    }else {
      root  = i;
    }
    dad[i]--;
  }

  vector<int> level(n, -1);
  queue<int> q;

  vector<vector<int> > nodes(n);
  nodes[0].push_back(root);
  q.push(root);
  level[root] = 0;
  int maxl = 0;
  while(!q.empty()) {
    int c = q.front();q.pop();

    for (int i=0;i<sons[c].size(); ++i) {
      q.push(sons[c][i]);

      level[sons[c][i]] = level[c] + 1;

      nodes[level[sons[c][i]]].push_back(sons[c][i]);

      maxl = max(maxl, level[sons[c][i]]);
    }
  }

  int Q;
  cin >> Q;
  vector<vector<dat> > a(maxl + 1);
  
  vector<int> ans(Q);

  for (int i =0 ;i<Q;++i){
    dat temp;
    scanf("%d %d %d", &temp.idx, &temp.from, &temp.to);
    temp.idx--;
    temp.qidx = i;
    a[level[temp.idx]].push_back(temp);
  }

  vector<vector<int> >* pr = NULL;
  vector<int> rev(n);
  for (int i = maxl; i >= 0; --i) {
    vector<vector<int> >* temp = new vector<vector<int> >(nodes[i].size(), vector<int>(1,1));

    for (int j=0;j<nodes[i].size(); ++j) {
      rev[nodes[i][j]] = j;
    }
    if ( i != maxl && pr != NULL) {
      for ( int j = 0;j < nodes[i+1].size(); ++j) {
        int idx = rev[dad[nodes[i+1][j]]];
        for(int q = 0; q < (*pr)[j].size(); ++q) {
          if ( q + 1 < (*temp)[idx].size()) {
            (*temp)[idx][q + 1] += (*pr)[j][q];
          } else {
            (*temp)[idx].push_back((*pr)[j][q]);
          }
        }
      }
    }
    for ( int j=0;j<nodes[i].size(); ++j ){ 
      if ((*temp)[j].size() > 1) {
        (*temp)[j][0] += (*temp)[j][1];
      }
    }

    for (int j = 0 ;j < a[i].size(); ++j) {
      const dat& cur = a[i][j];
      
      int idx = rev[cur.idx];
      int res = get((*temp)[idx], cur.from, cur.to, level[cur.idx]);

      ans[cur.qidx] = res;
    }

    if ( pr != 0) {
      delete pr;
    }
    pr = temp;
  }

  for ( int i = 0 ;i< ans.size(); ++i ) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
<!-- 0.0406s -->