#include<bits/stdc++.h>
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Rof(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
using pii = pair<int, int>;
const int N = 1e6 + 5;
struct node{
	int x, y, z;
	int op, w, id;
}p[N << 3];
int n, q, tot, fa[N], dep[N], siz[N], son[N], ans[N];
int dft, L[N], R[N], dfu[N], tax[N];
vector<int> e[N]; vector<array<int, 3>> lis;
void dfs(int now){
	siz[now] = 1; dep[now] = dep[fa[now]] + 1;
	L[now] = ++dft; dfu[dft] = now;
	for(int to : e[now]){
		if(to == fa[now]) continue;
		dfs(to); siz[now] += siz[to];
		if(siz[to] > siz[son[now]]) son[now] = to;
	}
	R[now] = dft;
}
void dot(int now, bool op){
	for(int to : e[now]){
		if(to == fa[now] || to == son[now]) continue;
		dot(to, 0);
	}
	if(son[now]) dot(son[now], 1);
	tax[dep[now]] = now;
	for(int to : e[now]){
		if(to == fa[now] || to == son[now]) continue;
		For(i, L[to], R[to]){
			int x = dfu[i];
			if(tax[dep[x]]) lis.push_back({dep[x] - dep[now], x, tax[dep[x]]});
		}
		For(i, L[to], R[to]){
			int x = dfu[i];
			if(!tax[dep[x]]) tax[dep[x]] = x;
		}
	}
	if(!op){
		For(i, L[now], R[now]){
			int x = dfu[i];
			tax[dep[x]] = 0;
		}
	}
}
int anc[N], lst[N]; set<int> S[N];
int find(int x){return anc[x] == x ? x : anc[x] = find(anc[x]);}
void merge(int x, int y, int tim){
	x = find(x); y = find(y);
	if(x == y) return;
	if(S[x].size() > S[y].size()) return;
	S[y].insert(S[x].begin(), S[x].end());
	for(int u : S[x]){
		auto it = S[y].lower_bound(u);
		if(it != S[y].begin()){
			int v = *prev(it);
			if(find(v) != find(u)){
				p[++tot] = {u, lst[u], tim, 0, -1, 0};
				p[++tot] = {u, lst[u] = v, tim, 0, 1, 0};
			}	
		}
		if((++it) != S[y].end()){
			int v = *it;
			if(find(v) != find(u)){
				p[++tot] = {v, lst[v], tim, 0, -1, 0};
				p[++tot] = {v, lst[v] = u, tim, 0, 1, 0};
			}
		}
	}
	S[x].clear(); fa[x] = y;
}
struct BIT{
	int t[N];
	int lowbit(int x){return x & (-x);}
	void add(int x, int y){x++; for(; x <= n + 1; x += lowbit(x)) t[x] += y;}
	int query(int x){x++; int res = 0; for(; x; x -= lowbit(x)) res += t[x]; return res;}
}bit;
void cdq(int l, int r){
	if(l == r) return;
	int mid = (l + r) >> 1;
	cdq(l, mid); cdq(mid + 1, r);
	int j = l;
	For(i, mid + 1, r){
		while(j <= mid && p[j].y <= p[i].y){
			if(!p[j].op) bit.add(p[j].z, p[j].w);
			j++;
		}
		if(!p[i].op) continue;
		ans[p[i].id] += p[i].w * bit.query(p[i].z);
	}
	while(j > l) if(!p[--j].op) bit.add(p[j].z, -p[j].w);
	inplace_merge(p + l, p + mid + 1, p + r + 1, [](node a, node b){return a.y < b.y;});
}
void Solve(){
	cin >> n >> q; int rt = -1;
	For(i, 1, n){
		cin >> fa[i]; if(!fa[i]) rt = i;
		if(fa[i]) e[fa[i]].push_back(i);
	}
	dfs(rt); dot(rt, 1);
	For(i, 1, q){
		int l, r, x; cin >> l >> r >> x;
		p[++tot] = {r, l - 1, x, 1, 1, i};
		p[++tot] = {l - 1, l - 1, x, 1, -1, i};
	}
	For(i, 1, n) p[++tot] = {i, 0, 0, 0, 1, 0};
	sort(lis.begin(), lis.end());
	For(i, 1, n) anc[i] = i, S[i].insert(i);
	for(auto [x, u, v] : lis) merge(u, v, x);
	For(i, 1, n){
		p[++tot] = {i, lst[i], dep[i], 0, -1, 9};
		p[++tot] = {i, n, dep[i], 0, 1, 0};
	}
	sort(p + 1, p + tot + 1, [](node a, node b){
		if(a.x != b.x) return a.x < b.x;
		if(a.y != b.y) return a.y < b.y;
		if(a.z != b.z) return a.z < b.z;
		return a.op < b.op;
	}); cdq(1, tot);
	For(i, 1, q) cout << ans[i] << '\n';
}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T = 1; //cin >> T;
	while(T--) Solve();
	return 0;
}