#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
int read(){
	int ret=0,f=1;char c=getchar();
	while(c>57||c<48){if(c=='-')f= -1;c=getchar();}
	while(c<=57&&c>=48)ret=(ret<<3)+(ret<<1)+(c-48),c=getchar();
	return ret*f;
}
void write(int x){
	if(x<0) x= -x,putchar('-');
	if(x>9)write(x/10);
	putchar(x%10+48);
}
const int maxn=2e5+5;
const int mod =1e9+7;
int n,m,r,ans[maxn];
vector<int>G[maxn];
int siz[maxn],son[maxn],dep[maxn],dfn[maxn],rnk[maxn],dcnt;
struct node{int x,y,z,t,opt;}cn[maxn];int ccnt=0;
vector<pair<int,int> >ud[maxn];
void dfs1(int u,int f){
    dep[u]=dep[f]+1;dfn[u]=++dcnt;rnk[dcnt]=u;siz[u]=1;
    for(int v:G[u]){
        dfs1(v,u);
        siz[u]+=siz[v];
        if(siz[son[u]]<siz[v])son[u]=v;
    }
}
set<int>s[maxn];
void dfs2(int u){
    for(int v:G[u]){
        if(v==son[u])continue;
        dfs2(v);
        for(int i=dfn[v];i<dfn[v]+siz[v];i++)s[dep[rnk[i]]].erase(rnk[i]);
    }
    if(son[u])dfs2(son[u]);
    for(int v:G[u]){
        if(v==son[u])continue;
        for(int i=dfn[v];i<dfn[v]+siz[v];i++){
            int x=rnk[i];
            auto it=s[dep[x]].lower_bound(x);
            if(it!=s[dep[x]].end())ud[*it].push_back({x,dep[x]-dep[u]});
            if(it!=s[dep[x]].begin())ud[x].push_back({*--it,dep[x]-dep[u]});
            s[dep[x]].insert(x);
        }
    }
    s[dep[u]].insert(u);
}
bool cmp1(node x,node y){
    if(x.x!=y.x)return x.x>y.x;
    if(x.y!=y.y)return x.y<y.y;
    if(x.z!=y.z)return x.z<y.z;
    return x.opt<y.opt;
}
bool cmp2(node x,node y){return x.y>y.y;}
int c[maxn];
inline int lowbit(int x){return x&-x;}
void add(int x,int k){for(;x<=n;x+=lowbit(x))c[x]+=k;}
int query(int x){int res=0;for(;x;x-=lowbit(x))res+=c[x];return res;}
void clear(int x){for(;x<=n;x+=lowbit(x))c[x]=0;}
void cdq(int l,int r){
    if(l>=r)return ;
    int mid=l+r>>1;
    cdq(l,mid),cdq(mid+1,r);
    sort(cn+l,cn+mid+1,cmp2),sort(cn+mid+1,cn+r+1,cmp2);
    for(int i=mid+1,j=l;i<=r;i++){
        if(cn[i].opt==0)continue;
        while(j<=mid&&cn[j].y<=cn[i].y){
            if(cn[j].opt==0)add(cn[j].z,cn[j].t);
            j++;
        }
        ans[cn[i].t]-=query(cn[i].z);
    }
    for(int i=l;i<=mid;i++)clear(cn[i].z);
}
void solve(){
	n=read(),m=read();
    for(int i=1;i<=n;i++){
        int x=read();
        if(x==0)r=i;
        G[x].push_back(i);
    }
    for(int i=1;i<=m;i++){
        int l=read(),r=read(),x=read();
        cn[++ccnt]={l,r,x,i,1};
        ans[i]+=r-l+1;
    }
    dfs1(r,0);
    dfs2(r);
    for(int i=1;i<=n;i++)ud[i].push_back({i,dep[i]});
    for(int i=1;i<=n;i++){
        sort(ud[i].begin(),ud[i].end());
        reverse(ud[i].begin(),ud[i].end());
        int mn=n+1;
        for(auto[x,y]:ud[i]){
            if(y>=mn)continue;
            if(mn<=n)cn[++ccnt]={x,i,mn,-1,0};
            cn[++ccnt]={x,i,y,1,0};
            mn=y;
        }
    }
    // for(int i=1;i<=ccnt;i++){
    //     cerr<<cn[i].opt<<' '<<cn[i].x<<' '<<cn[i].y<<' '<<cn[i].z<<' '<<cn[i].t<<endl;
    // }
    sort(cn+1,cn+ccnt+1,cmp1);
    cdq(1,ccnt);
    for(int i=1;i<=m;i++)write(ans[i]),putchar('\n');
}
signed main(){
    int T=1;
    while(T--)solve();
    return 0;
}