#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
#define ull unsigned ll
#define vi vector<int> 
#define pb push_back
#define SZ(x) ((int)x.size())
#define BG(x) (x.begin())
#define ED(x) (x.end())
#define pii pair<int,int>
#define x first
#define y second
#define MD(x) ((x)%=mod)
#define gmax(x,y) (x=max(x,y))
#define gmin(x,y) (x=min(x,y))
#define ppct __builtin_popcount
#define mkp make_pair

namespace Mine {
	#define gc() getchar()
	ll read() {
		ll x=0;bool f=0;char ch=gc();
		while(!isdigit(ch)) {if(ch=='-') f=1;ch=gc();}
		while(isdigit(ch)) x=x*10+(ch^48),ch=gc();                                                                             
		return f?-x:x;
	}
	const int N=1e5+100,M=1e6+100+2e6,Q=1e6+10,len=18;
	int n,m,ans[Q],fa[N],f[N][19],root;
	vi G[N];
	int top[N],dep[N],son[N],siz[N],dfn[N],rk[N],R[N];
	namespace T {
		void dfs1(int u) {
			f[u][0]=fa[u];
			For(i,1,len) f[u][i]=f[f[u][i-1]][i-1];
			siz[u]=1,dep[u]=dep[fa[u]]+1;
			for(int to:G[u]) {
				dfs1(to),siz[u]+=siz[to];
				if(siz[to]>siz[son[u]]) son[u]=to;
			}
		}
		int tot=0;
		void dfs2(int u,int tt) {
			top[u]=tt,dfn[u]=++tot,rk[dfn[u]]=u;
			if(son[u]) dfs2(son[u],tt);
			for(int to:G[u]) if(to!=son[u]) dfs2(to,to);
		}
		void build() {
			dfs1(root),dfs2(root,root);
		}
	}
	namespace sgt {
#define lc (u<<1)
#define rc (u<<1|1)
#define mid ((l+r)>>1)
		set<pii> tr[N<<2];
		void mdf(int ql,int qr,int val,int u=1,int l=1,int r=n) {
			if(ql<=l && r<=qr) {
				tr[u].insert((pii){dep[val],val});
				return ;
			}
			if(ql<=mid) mdf(ql,qr,val,lc,l,mid);
			if(mid<qr) mdf(ql,qr,val,rc,mid+1,r);
		}
		int ask(int pos,int val,int u=1,int l=1,int r=n) {
			int ret=0;
			auto it=prev(tr[u].upper_bound((pii){dep[val],1e9}));
			if((it->x)==dep[val]) ret=it->y;
			if(l==r) return ret;
			if(pos<=mid) gmax(ret,ask(pos,val,lc,l,mid));
			else gmax(ret,ask(pos,val,rc,mid+1,r));
			return ret;
		}
		void build(int u=1,int l=1,int r=n) {
			tr[u].insert((pii){-1e9,-1e9}),tr[u].insert((pii){1e9,1e9});
			if(l==r) return ;
			build(lc,l,mid),build(rc,mid+1,r);
		}
	}
	// struct node {
		// int l,r,d,t,id;
	// } q[M];
	// int tot;
	// void ins(int l,int r,int d,int t) {q[++tot]={l,r,d,t,-1};}
	// void add(int l,int r,int dl,int dr,int add) {
		// ins(l,-r,dr,add);
		// ins(l,-r,dl-1,-add);
	// }
	// namespace cdq {
// 		
	// }
	namespace bit {
		int tr[N];
		void add(int pos,int val) {
			for(pos++;pos<N;pos+=pos&-pos) tr[pos]+=val;
		}
		int ask(int pos) {
			int ret=0;
			for(pos++;pos;pos&=pos-1) ret+=tr[pos];
			return ret;
		}
		void add(int ql,int qr,int val) {
			add(ql,val); add(qr+1,-val);
		}
	};
	int ask(int x) {
		int t=x;
		Rof(i,len,0) if(f[x][i] && !sgt::ask(dfn[f[x][i]],x)) x=f[x][i];
		return dep[t]-dep[x];
	}
	void mdf(int x) {
		int t=ask(x);
		// cout<<x<<" "<<t<<" "<<sgt::ask(dfn[f[x][1]],x)<<endl;
		bit::add(0,t,1);
		while(x) {
			sgt::mdf(dfn[top[x]],dfn[x],x);
			x=fa[top[x]];
		}
	}
	vector<pii> vec[N];
	void main() {
		n=read(),m=read();
		For(i,1,n) {
			fa[i]=read();
			// cout<<fa[i]<<" "<<i<<endl;
			if(fa[i]==0) root=i;
			else G[fa[i]].pb(i);
		}
		T::build();
		// For(i,1,n) cout<<top[i]<<" ";
		// cout<<endl;
		sgt::build();
		int tot=0;
		For(i,1,m) {
			int l=read(),r=read(),d=read();
			vec[r].pb((pii){d,i});
			// q[++tot]={l,r,d,0,i};
		}
		// sort(q+1,q+1+m,[](node x,node y) {return x.r<y.r;});
		For(i,1,n) {
			mdf(i);
			for(auto j:vec[i]) {
				ans[j.y]=bit::ask(j.x);
			}
		}
		For(i,1,m) {
			printf("%d\n",ans[i]);
		}
	}
}
signed main() {
	// freopen("prefix.in","r",stdin);
	// freopen("prefix.out","w",stdout);
	Mine::main();
	return 0;
}