#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>
using namespace std;
long long he[200001],prenum[200001],postnum[200001],sum[200001],maxh,br,h,n,par[200001],used[200001],root,k,c,a,b;
vector<long long> vis[200001],res[200001],child[200001];
vector<pair<long long, long long> > height[200001];
void solve(long long c, long long a, long long b)
{
    long long ans=0;
    //cout<<a<<" "<<he[c]<<" "<<maxh<<endl;
    if(a<=0) ans=min(-a,he[c]-1)+1;
    else if(a+he[c]>maxh) {printf("0\n"); return;}
    else
    {
        int p1=lower_bound(vis[a+he[c]].begin(),vis[a+he[c]].end(),prenum[c])-vis[a+he[c]].begin();
        int p2=upper_bound(vis[a+he[c]].begin(),vis[a+he[c]].end(),postnum[c])-vis[a+he[c]].begin();
        if(p1>vis[a+he[c]].size()-1) {}
        else
        {
            if(p2>vis[a+he[c]].size()-1) p2=vis[a+he[c]].size()-1;
            //cout<<p1<<" "<<p2<<endl;
            if(p1>0) ans=res[a+he[c]][p2]-res[a+he[c]][p1-1];
            else ans=res[a+he[c]][p2];
            //cout<<ans<<endl;
        }
    }
    if(b>=maxh-he[c])
    {
        if(a<=0) printf("%lld\n",ans+sum[c]-1);
        else printf("%lld\n",ans);
        return;
    }
    else if(b<=0) {printf("%lld\n",ans); return;}
    int p1=lower_bound(vis[b+1+he[c]].begin(),vis[b+1+he[c]].end(),prenum[c])-vis[b+1+he[c]].begin();
    int p2=upper_bound(vis[b+1+he[c]].begin(),vis[b+1+he[c]].end(),postnum[c])-vis[b+1+he[c]].begin();
    //cout<<p1<<" "<<p2<<endl;
    if(p1>vis[b+1+he[c]].size()-1) {}
    else
    {
        if(a<=0) ans*=-1;
        if(p2>vis[b+1+he[c]].size()-1) p2=vis[b+1+he[c]].size()-1;
        if(p1>0) ans-=res[b+1+he[c]][p2]-res[b+1+he[c]][p1-1];
        else ans-=res[b+1+he[c]][p2];
        if(a<=0) ans*=-1;
    }
    printf("%lld\n",ans);
    //cout<<ans<<" "<<13<<endl;
    return;
}
int numeration(long long p)
{
    prenum[p]=++br;
    h++;
    maxh=max(maxh,h);
    int m=child[p].size();
    if(m==0) {he[p]=h; height[h].push_back(make_pair(prenum[p],1)); h--; postnum[p]=++br; return 1;}
    for(int i=0; i<=m-1; i++)
    {
        sum[p]+=numeration(child[p][i]);
    }
    he[p]=h;
    sum[p]++;
    height[h].push_back(make_pair(prenum[p],sum[p]));
    h--;
    postnum[p]=++br;
    return sum[p];
}
int main()
{
	freopen("tree.in","r",stdin);
	freopen("tree.out","w",stdout);
	scanf("%lld",&n);
	for(int i=1; i<=n; i++)
	{
	    scanf("%lld",&par[i]);
	    used[par[i]]=1;
	    child[par[i]].push_back(i);
	    if(par[i]==-1) {root=i;}
	}
	numeration(root);
	for(int i=1; i<=maxh; i++)
	{
	    int m=height[i].size();
	    sort(height[i].begin(),height[i].end());
	    if(m==0) continue;
	    res[i].push_back(height[i][0].second);
	    vis[i].push_back(height[i][0].first);
	    for(int j=1; j<=m-1; j++)
	    {
	        res[i].push_back(res[i][j-1]+height[i][j].second);
	        vis[i].push_back(height[i][j].first);
	    }
	}
	scanf("%lld",&k);
	for(int i=1; i<=k; i++)
	{
	    scanf("%lld%lld%lld",&c,&a,&b);
	    solve(c,a,b);
	}
	return 0;
}
<!-- 0.0463s -->