#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define MAX_S 500010
int N , Q , root;
vi fo[200010];
// BIT
int BIT[MAX_S];
void add(int pos , int w){
  ++pos;
  for(;pos < MAX_S;pos += (pos&(-pos)))
   BIT[pos] += w;
}
int get(int pos){
  ++pos;
  int ret = 0;
  for(;pos>0;pos -= (pos&(-pos)))
   ret += BIT[pos];
  return ret;
}
int get_interval(int lo , int hi){
  if(lo > hi)return 0;
  if(lo == 0)return get(hi);
  return get(hi) - get(lo-1);
}
// </end>
// dfs
int dpt[200010] , fin[200010] , fout[200010];
vi obh;
vi st_vr , st_s;
void dfs(){
  st_vr.pb(root);
  st_s.pb(1);
  dpt[root] = 0;
  while(!st_vr.empty()){
   int vr = st_vr.back();
   int st = st_s.back();
   if(st == 1){
    obh.pb(vr);
    st_s.back() = -1;
    for(int i=0;i<sz(fo[vr]);++i)
     st_vr.pb(fo[vr][i]),
     st_s.pb(1),
     dpt[fo[vr][i]] = dpt[vr] + 1;
              }
   else{
    obh.pb(vr);
    st_vr.pop_back();
    st_s.pop_back();
       }
                       }
}
// Querry
int ans[500010];
struct querry{
  int id , sgn;
  int vr , hi;
  querry(){}
  querry(int _id , int _sgn , int _vr , int _hi){
   id = _id , sgn = _sgn , vr = _vr , hi = _hi;
                                                }
};
vector<querry> vq;
// Buffers
#define BUF_SZ 500010
#define IK 0
vi buf[BUF_SZ];
int main(){
  freopen("tree.in" , "r" , stdin);
  freopen("tree.out" , "w" , stdout);
  scanf("%d" , &N);
  for(int i=0;i<N;++i){
   int vr;
   scanf("%d" , &vr);
   --vr;
   if(vr < 0)root = i;
   else fo[vr].pb(i);
                      }
  // DFS stuff
  dfs();
  memset(fin , -1 , sizeof fin);
  for(int i=0;i<sz(obh);++i)
   if(fin[ obh[i] ] == -1)
    fin[ obh[i] ] = i;
   else
    fout[ obh[i] ] = i;
  // Querry prec
  scanf("%d" , &Q);
  for(int i=0;i<Q;++i){
   int vr , lo , hi;
   scanf("%d%d%d" , &vr , &lo , &hi);
   --vr;
   relaxMax(lo , -dpt[vr]);
   lo += dpt[vr];
   hi += dpt[vr];
   if(0 <= lo-1)
    vq.pb(querry(i , -1 , vr , lo-1));
   if(0 <= hi)
    vq.pb(querry(i , 1 , vr , hi));
                      }
  // Sorting vertices
  vi ver;
  for(int i=0;i<N;++i)
   buf[ dpt[i] ].pb(i);
  for(int i=0;i<BUF_SZ;++i){
   for(int j=0;j<sz(buf[i]);++j)
    ver.pb(buf[i][j]);
   buf[i].clear();
                           }
  // Sorting querries
  for(int i=0;i<sz(vq);++i)
   buf[ vq[i].hi + IK ].pb(i);
  int vpos = 0;
  for(int i=0;i<BUF_SZ;++i){
   for(int j=0;j<sz(buf[i]);++j){
    querry& tq = vq[ buf[i][j] ];
    int val = min(dpt[tq.vr] , tq.hi) + 1;
    while(vpos < sz(ver) && dpt[ver[vpos]] <= tq.hi){
     add(fin[ ver[vpos] ] , +1);
     ++vpos;
                                                    }
    val += get_interval(fin[ tq.vr ] + 1 , fout[ tq.vr ] - 1);
    if(tq.sgn == 1)
     ans[ tq.id ] += val;
    else
     ans[ tq.id ] -= val;
                                }
                           }
  for(int i=0;i<Q;++i)
   printf("%d\n" , ans[i]);
  return 0;
}