#include<bits/stdc++.h>
namespace xcy{
typedef int ll;
const int MAXN=100005;
const int MAXM=1000005;
#define emp emplace
#define emb emplace_back
ll tr[MAXN<<9],l[MAXN<<9],r[MAXN<<9],rt[MAXN],head[MAXN],q[MAXM][3],ans[MAXM],num,cnt,trt,n,m,i,j,k;
ll dfn[MAXN],rv[MAXN],top[MAXN],son[MAXN],siz[MAXN],fa[MAXN],dep[MAXN],tim;
std::vector<ll>vq[MAXN];struct Ed{ll pre,to;}ed[MAXN];
struct Nd{mutable ll l,r,v;Nd(ll L,ll R,ll V){l=L,r=R,v=V;}
    bool operator<(const Nd &A)const{return l==A.l?r<A.r:l<A.l;}
};std::set<Nd>s[MAXN<<1];

inline void fread(ll &X){ll A=1;X=0;char C=getchar();while(!isdigit(C)&&C!='-')C=getchar();if(C=='-')A=-1,C=getchar();while(isdigit(C))X=(X<<1)+(X<<3)+(C^48),C=getchar();X*=A;}
inline void fout(ll X,char Ch=' '){if(X<0)putchar('-'),X=-X;if(!X){putchar('0'),putchar(Ch);return;}char C[25]{};int Len=0;while(X)C[++Len]=X%10+'0',X/=10;for(;Len;--Len)putchar(C[Len]);putchar(Ch);}
inline void add(ll F,ll T){ed[++cnt].to=T;ed[cnt].pre=head[F];head[F]=cnt;}
inline void dfs1(ll N)
{
    siz[N]=1;for(ll I=head[N],J;I;I=ed[I].pre)
        J=ed[I].to,dep[J]=dep[N]+1,dfs1(J),
        siz[N]+=siz[J],(siz[J]>siz[son[N]]?son[N]=J:0);
}
inline void dfs2(ll N,ll T)
{
    dfn[N]=++tim;top[N]=T;if(son[N])dfs2(son[N],N);
    for(ll I=head[N],J;I;I=ed[I].pre)
        if((J=ed[I].to)!=son[N])dfs2(J,J);
}
inline ll mdf(ll N,ll L,ll R,ll X,ll V)
{
    if(!N)N=++num;if(L==R){tr[N]+=V;return N;}ll M=L+R>>1;
    if(X<=M)l[N]=mdf(l[N],L,M,X,V);else r[N]=mdf(r[N],M+1,R,X,V);
    tr[N]=tr[l[N]]+tr[r[N]];return N;
}
inline ll qry(ll N,ll L,ll R,ll X)//suffix
{
    if(!N)return 0;
    if(L==X)return tr[N];ll M=L+R>>1;
    if(X<=M)return qry(l[N],L,M,X)+tr[r[N]];
    return qry(r[N],M+1,R,X);
}
inline void tmdf(ll L,ll R,ll X,ll V){if(!X||L>R)return;
    for(;L<=n;L+=L&-L)rt[L]=mdf(rt[L],1,n,X,V);
    for(++R;R<=n;R+=R&-R)rt[R]=mdf(rt[R],1,n,X,-V);}
inline ll tqry(ll I,ll X)
    {ll Res=0;for(;I;I-=I&-I)Res+=qry(rt[I],1,n,X);return Res;}
inline void sins(ll N,ll L,ll R,ll V){if(L<=R)s[N].emp(L,R,V);}
inline void work(ll N,ll L,ll R,ll V)
{
    auto Li=--s[N].lower_bound({L+1,0,0}),
         Ri=--s[N].lower_bound({R+1,0,0}),Nw=Li,Ls=Li;
    assert(Li->l<=L&&R<=Ri->r);
    ll Ll=Li->l,Rr=Li->r,Vv=Li->v;
    if(Li==Ri){assert(Ll<=L&&R<=Rr);s[N].erase(Li),
        sins(N,Ll,L-1,Vv),sins(N,L,R,V),sins(N,R+1,Rr,Vv),
        tmdf(L,R,Vv,-1),tmdf(L,R,V,1);return;}
    for(++Nw;Nw!=Ri;)tmdf(Nw->l,Nw->r,Nw->v,-1),
        Ls=Nw,++Nw,s[N].erase(Ls);
    s[N].erase(Li),sins(N,Ll,L-1,Vv),tmdf(L,Rr,Vv,-1);
    Ll=Ri->l,Rr=Ri->r,Vv=Ri->v;
    s[N].erase(Ri),sins(N,R+1,Rr,Vv),tmdf(Ll,R,Vv,-1);
    sins(N,L,R,V),tmdf(L,R,V,1);
}
inline void ins(ll N)
{
    ll L,R,X=0,Y=0,V=N;for(N=fa[N];N;N=fa[top[N]])
        L=dfn[top[N]],R=dfn[N],Y=X+1,X+=R-L+1,assert(L),work(X-L+MAXN,Y,X,V);
}

int mian()
{
    fread(n);fread(m);for(i=1;i<=n;++i)
        fread(fa[i]),add(fa[i],i),(fa[i]?0:trt=i);
    for(i=1;i<=m;++i)fread(q[i][0]),fread(q[i][1]),
        fread(q[i][2]),vq[q[i][1]].emb(i);
    for(i=0;i<2*MAXN;++i)s[i].emp(1,n,0);
    dfs1(trt);dfs2(trt,trt);for(i=1;i<=n;++i)
        {ins(i);for(auto I:vq[i])ans[I]=tqry(q[I][2],q[I][0]);}
    for(i=0;i<2*MAXN;++i){j=0;for(auto I:s[i])assert(I.l==j+1&&I.l<=I.r),j=I.r;assert(j==n);}
    for(i=1;i<=m;++i)fout(ans[i],'\n');return 0;
}}
int main(){return xcy::mian();}