#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);++i)
#define ForDown(i,j,k) for(int i=(j);i>=(k);--i)
#define Debug(fmt, args...) fprintf(stderr,"(func %s, line #%d): " fmt,__func__,__LINE__,##args),fflush(stderr)
#define debug(fmt, args...) fprintf(stderr,fmt,##args),fflush(stderr)
#define within :
#define LJY main
using namespace std;
typedef long long ll;
const int N=1e5+5,M=1e6+5;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
inline int read(){
  char ch=getchar();int x=0,f=1;
  while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
  while(ch>='0'&&ch<='9')
    x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return x*f;
}
int n,m,rt,f[N],siz[N],dep[N],dfn[N],idfn[N],cdfn;
vector<int>G[N],vec[N];
void dfs(int u,int fa){
  dep[u]=dep[fa]+1;idfn[dfn[u]=++cdfn]=u;siz[u]=1;
  for(int v within G[u]) dfs(v,u),siz[u]+=siz[v];
}
struct Query{int x,y,z,op,id;}Mdf[N<<5];int tot;
int ans[M];
struct LCT{
  struct Node{int s[2],fa,vl,tag;}T[N];
  void PutTag(int u,int c){if(u) T[u].tag=T[u].vl=c;}
  void pushdown(int u){if(T[u].tag!=-1) PutTag(T[u].s[0],T[u].tag),PutTag(T[u].s[1],T[u].tag),T[u].tag=-1;}
  #define isroot(x) (T[T[x].fa].s[0]!=x&&T[T[x].fa].s[1]!=x)
  #define get(x) (T[T[x].fa].s[1]==x)
  void Update(int x){if(!isroot(x)) Update(T[x].fa);pushdown(x);}
  void rotate(int x){
    int y=T[x].fa,z=T[y].fa,k=get(x),w=T[x].s[!k];
    if(!isroot(y)) T[z].s[get(y)]=x;
    T[x].s[!k]=y;T[y].s[k]=w;
    T[x].fa=z;T[y].fa=x;if(w) T[w].fa=y;
  }void splay(int x){
    Update(x);for(int f;f=T[x].fa,!isroot(x);rotate(x))
      if(!isroot(f)) rotate(get(f)==get(x)?f:x);
  }void access(int x){
    // Debug("%d\n",x);
    int u=x,p;static vector<pair<int,int> >tmp;tmp.clear();
    for(p=0;x;x=T[p=x].fa){
      splay(x);T[x].s[1]=p;
      if(T[x].vl) tmp.emplace_back(dep[x],T[x].vl);
    }splay(u);PutTag(u,u);reverse(tmp.begin(),tmp.end());x=u;
    // for(auto [p,t] within tmp) Debug("%d %d\n",p,t);
    // For(i,1,n) debug("%d ",T[i].fa);debug("\n");
    // For(i,1,n) debug("%d ",T[i].s[0]);debug("\n");
    // For(i,1,n) debug("%d ",T[i].s[1]);debug("\n");
    // For(i,1,n) debug("%d ",T[i].fa);debug("\n");
    Mdf[++tot]={x,x,1,0,1};Mdf[++tot]={x,x,dep[x],0,-1};
    int lp=x,lt=dep[x];
    for(auto [p,t] within tmp){
      Mdf[++tot]={t,x,lt,0,1};
      Mdf[++tot]={t,x,dep[x]-p,0,-1};
      lp=dep[x]-p;lt=t;
    }
  }void erase(int x){
    // Debug("%d\n",x);
    int p,u=x;for(p=0;x;x=T[p=x].fa) splay(x),T[x].s[1]=p;
    splay(u);PutTag(u,0);
  }
}tr;
struct BIT{
  int c[N];
  void update(int x,int v){while(x<=n) c[x]+=v,x+=(x&-x);}
  int query(int x){int s=0;while(x) s+=c[x],x^=(x&-x);return s;}
}bit;
void cdq(int l,int r){
  if(l==r) return;
  int mid=(l+r)>>1;
  cdq(l,mid);cdq(mid+1,r);
  sort(Mdf+l,Mdf+mid+1,[](Query a,Query b){return a.y<b.y;});
  sort(Mdf+mid+1,Mdf+r,[](Query a,Query b){return a.y<b.y;});
  int j=l;for(int i=mid+1;i<=r;i++) if(Mdf[i].op){
    while(j<=mid&&Mdf[j].y<=Mdf[i].y){
      if(!Mdf[j].op) bit.update(Mdf[j].z,Mdf[j].id);j++;
    }ans[Mdf[i].id]+=bit.query(Mdf[i].z);
  }For(i,l,j-1) if(!Mdf[i].op) bit.update(Mdf[i].z,-Mdf[i].id);
}
signed LJY(){
  n=read();m=read();
  For(i,1,n){
    G[f[i]=read()].emplace_back(i),tr.T[i].fa=f[i];
    if(!f[i]) rt=i;
  }dfs(rt,0);
  For(i,1,n) vec[dep[i]].emplace_back(i);
  For(i,1,n) if(vec[i].size()){
    // for(int x within vec[i]) debug("%d ",x);debug("\n");
    for(int x within vec[i]) tr.access(x);
    for(int x within vec[i]) tr.erase(x);
  }
  For(i,1,m){
    int l=read(),r=read(),x=read();
    Mdf[++tot]={l,r,x,1,i};
  }sort(Mdf+1,Mdf+1+tot,[&](Query x,Query y){return x.x!=y.x?x.x>y.x:(x.y!=y.y?x.y<y.y:x.z!=y.z?x.z<y.z:x.op<y.op);});
  // For(i,1,tot) debug("%d %d %d %d %d\n",Mdf[i].x,Mdf[i].y,Mdf[i].z,Mdf[i].op,Mdf[i].id);
  cdq(1,tot);For(i,1,m) printf("%d\n",ans[i]);
  return 0;
}