//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
int const N=1e5+10;
int n,m,root,out,siz[N],nxt[N],dep[N],heavy[N];
struct node{int l,r,dep;};
vector<node>add,del;vector<int>a[N];set<int>d[N];
inline void dfs1(int x){
	siz[x]=1;
	for (auto v:a[x]){
		dep[v]=dep[x]+1,dfs1(v),siz[x]+=siz[v];
		if (siz[v]>siz[heavy[x]]) heavy[x]=v;
	}
}
vector<int>vec;
inline void Add(int x,int las){
	int g=dep[x]-out;
	auto it=d[dep[x]].upper_bound(x);
	if (it!=d[dep[x]].end() && nxt[x]>(*it)) add.push_back((node){x,(*it),g}),del.push_back((node){x,nxt[x],g});
	if (it!=d[dep[x]].begin()) add.push_back((node){(*prev(it)),x,g});
	vec.push_back(x);
	for (auto v:a[x]) Add(v,las);
}
inline void dfs2(int x,int las){
	if (a[x].size()>1) las=1;
	else ++las;
	for (auto v:a[x]) if (v^heavy[x]){
		dfs2(v,las);
		for (int D=dep[v];d[D].size();++D){
			int las=0;
			for (auto it:d[D]) nxt[it]=1e9;
			for (auto it:d[D]) nxt[las]=it,las=it;
			d[D].clear();
		}
	}
	if (heavy[x]) dfs2(heavy[x],las);
	out=dep[x];
	for (auto v:a[x]) if (v^heavy[x]){
		vec.clear(),Add(v,las);
		for (auto x:vec) d[dep[x]].insert(x);
	}
	d[dep[x]].insert(x);
}
inline void solve(){
	cin>>n>>m;
	rep(i,1,n){
		int p;cin>>p;
		if (p) a[p].push_back(i);
		else root=i;
	}
	memset(nxt,0x3f,sizeof(nxt));
	dfs1(root),dfs2(root,1);
	while (m--){
		int l,r,x;cin>>l>>r>>x;
		int res=0;
		rep(i,l,r) res+=dep[i]>=x;
		for (auto it:add) if (l<=it.l && it.r<=r && it.dep<=x) --res;
		for (auto it:del) if (l<=it.l && it.r<=r && it.dep<=x) ++res;
		cout<<res<<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	// cin>>t;
	while (t--) solve();
	return 0;
}