#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define USE_FREAD_FWRITE
#define READ_NEGATIVE
#define WRITE_NEGATIVE
#define DEFAULT_TYPE int
namespace IO{
#ifdef USE_FREAD_FWRITE
#define SIZE (1<<20)
	char in[SIZE],out[SIZE],*p1=in,*p2=in,*p3=out;
	char getchar(){ return p1==p2&&(p2=(p1=in)+fread(in,1,SIZE,stdin),p1==p2)?EOF:*p1++; }
	void flush(){ int len=p3-out; fwrite(p3=out,1,len,stdout); }
	void putchar(char ch){ if(p3==out+SIZE)flush(); *p3++=(ch); }
	struct Flush{~Flush(){flush();}}_;
#else
	char getchar(){ return ::getchar(); }
	void putchar(char ch){ ::putchar(ch); }
	void flush(){}
#endif
	template<typename type=DEFAULT_TYPE> inline type read(){
#ifdef READ_NEGATIVE
		type x(0);bool flag(0);char ch=getchar();
		for(;ch<'0'||ch>'9';ch=getchar())flag^=ch=='-';
		for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
		return flag?-x:x;
#else
		type x(0);char ch=getchar();
		for(;ch<'0'||ch>'9';ch=getchar());
		for(;ch>='0'&&ch<='9';ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
		return x;
#endif
	}
	template<typename type>
	inline void write(type x){
#ifdef WRITE_NEGATIVE
		if(x<0)x=-x,putchar('-');
#endif
		static int Stack[50],top(0);
		do Stack[++top]=x%10,x/=10;while(x);
		while(top) putchar(Stack[top--]|48);
	}
}
using IO::read;
using IO::write;
const int N=1e5+10,M=1e6+10;
int n,m;
vector<int> g[N];
int fa[N],dep[N],dfn[N],ord[N],dfcnt;
vector<int> rdep[N];
int hpre[N];
void dfs(int u){
	dep[u]=dep[fa[u]]+1;
	if(!rdep[dep[u]].empty()) hpre[u]=rdep[dep[u]].back();
	rdep[dep[u]].push_back(u);
	dfn[u]=++dfcnt;
	ord[dfcnt]=u;
	for(int v:g[u]) dfs(v);
}
struct lca_t{
	int st[21][N];
	inline int choose(int u,int v) const { return dep[u]<dep[v]?u:v; }
	inline void init(){
		for(int i=1;i<=n;i++) st[0][i]=ord[i];
		for(int j=1;j<=20;j++){
			auto lst=st[j-1],cur=st[j];
			for(int i=1;i<=n-(1<<j)+1;i++) {
				cur[i]=choose(lst[i],lst[i+(1<<j>>1)]);
			}
		}
	}
	inline int qst(int l,int r) const {
		int len=31^__builtin_clz(r-l+1);
		return choose(st[len][l],st[len][r-(1<<len)+1]);
	}
	inline int operator()(int u,int v) const {
		if(dfn[u]>dfn[v]) swap(u,v);
		int lc=qst(dfn[u],dfn[v]);
		if(lc==u) return u;
		else return fa[lc];
	}
}lca;
struct DS{
	struct BIT{
		// O(1) prefix add, O(sqrt) pt query
		int t1[N],t2[(N>>6)+2],t3[(N>>12)+2];
		inline void c(int x,int d){
			// printf("c %d %d\n",x,d);
			x^=131071;
			t1[x]+=d; t2[x>>6]+=d; t3[x>>12]+=d;
		}
		inline void clear(){
			// puts("clear");
			memset(this,0,sizeof(BIT));
		}
		inline int q(int x){
			x^=131071;
			int ans=0;
			for(int i=0;i<(x>>12);i++) ans+=t3[i];
			for(int i=(x>>12)<<6;i<(x>>6);i++) ans+=t2[i];
			for(int i=(x>>6)<<6;i<=x;i++) ans+=t1[i];
			return ans;
		}
	}T;
	int lst[N],nxt[N];
	int dlst[N],dnxt[N];
	void init(int l,int r){
		for(int i=0;i<=n;i++) nxt[i]=lst[i]=0;
		// O(n)
		T.clear();
		for(int i=1;i<=n;i++){
			int tmp=0,dtmp=0;
			for(int u:rdep[i]) {
				if(hpre[u]!=0) dtmp=max(dtmp,hpre[u]);
				if(l<=u&&u<=r) {
					if(tmp) nxt[tmp]=u,dnxt[tmp]=dtmp;
					lst[u]=tmp,dlst[u]=dtmp;
					int ht=dtmp-1;
					if(!lst[u]) ht=dep[u]-1;
					T.c(ht,1);
					// printf("%d lst=%d ht=%d\n",u,tmp,ht);
					tmp=u; dtmp=0;
				}
			}
		}
		for(int i=1;i<=n;i++) {
			if(!lst[i]) dlst[i]=dep[i];
			if(!nxt[i]) dnxt[i]=dep[i];
		}
		topx=topy=0;
	}
	pair<int*,int> stk[M]; int topx;
	pair<int,int> stt[M]; int topy;
	inline void mv(int&x,int y){ stk[++topx]={&x,x}; x=y; }
	inline void ct(int x,int y){ T.c(x,y); stt[++topy]={x,-y}; }
	inline void remove(int x){
		// O(1) non-amortized
		// printf("remove %d lst %d nxt %d ht %d\n",x,lst[x],nxt[x],ht);
		ct(min(dlst[x],dnxt[x])-1,-1);
		if(dlst[x]<dnxt[x]) mv(dnxt[lst[x]],dnxt[x]);
		else mv(dlst[nxt[x]],dlst[x]);
		if(nxt[x]) mv(lst[nxt[x]],lst[x]);
		if(lst[x]) mv(nxt[lst[x]],nxt[x]);
	}
	inline void undo(int rx,int ry){
		// O(1)
		while(topx>rx){
			*stk[topx].first=stk[topx].second;
			topx--;
		}
		while(topy>ry){
			T.c(stt[topy].first,stt[topy].second);
			topy--;
		}
	}
	inline int query(int x){
		return T.q(x);
	}
}T;
mt19937 e(time(0));
const int B=101,R=N/B+3;
struct query_t{
	int l,r,x,id;
};
int ans[M];
vector<query_t> bq[R];
int bl[R];
int main(){
	n=read(); m=read();
	int rt=0;
	for(int i=1;i<=n;i++){
		fa[i]=read();
		if(!fa[i]) rt=i;
		else g[fa[i]].push_back(i);
	}
	dfs(rt);
	lca.init();
	for(int i=1;i<=n;i++) if(hpre[i]) hpre[i]=dep[i]-dep[lca(i,hpre[i])];
	for(int i=0;i<R;i++) bl[i]=1+i*B;
	for(int i=1;i<=m;i++){
		int l,r,x;
		l=read(); r=read(); x=read();
		int bid=upper_bound(bl,bl+R,l)-1-bl;
		bq[bid].push_back({l,r,x,i});
	}
	for(int i=0;i<R;i++) if(bq[i].size()) {
		sort(bq[i].begin(),bq[i].end(),[&](const query_t& x,const query_t& y){
			return x.r>y.r;
		});
		T.init(bl[i],n);
		int lstr=n;
		for(query_t q:bq[i]){
			while(lstr>q.r) T.remove(lstr--);
			int rx=T.topx,ry=T.topy;
			for(int j=bl[i];j<q.l;j++) T.remove(j);
			ans[q.id]=T.query(q.x);
			T.undo(rx,ry);
		}
	}
	for(int i=1;i<=m;i++){
		write(ans[i]); IO::putchar('\n');
	}
}