#include<algorithm>
#include<iostream>
#include<vector>
#include<set>

const int N = 1e5;
int n, m, rt, tt, pr[N], ans[N], ft[N+1];
std::vector<int>g[N];
std::vector<std::pair<int, int>>rg[N];
std::set<int>p[N];
struct el { int i, a, b, c, k; } a[N*20];
void ad(int i, int k) {
	for (i+=2; i<=n; i+=i&-i) ft[i] += k;
}
int qr(int i) { int k = 0;
	for (i+=2; i; i-=i&-i) k += ft[i];
	return k;
}
std::vector<int>dfs(int u) {
	std::vector<int>s, t;
	for (int v : g[u]) {
		if (t = dfs(v), s.size() < t.size()) s.swap(t);
		for (int i=0; i<t.size(); i++)
			rg[t.size()-i].push_back({s[i], t[i]});
	}
	return s.push_back(u), std::move(s);
}
void inline mg(int i, std::set<int>&s, std::set<int>&t) {
	auto md = [&](int x, int y) {
		a[tt++] = {-1, i, x, pr[x], -1};
		a[tt++] = {-1, i, x, pr[x]=y, 1};
	};
	for (int x : t) {
		auto it = s.lower_bound(x);
		if (it != s.end()) md(*it, x);
		if (it != s.begin()) md(x, *std::prev(it));
		s.insert(it, x);
	}
}
void sv(int l, int r) {
	if (r - l == 1) return;
	int m = l + r >> 1, i, j;
	for (sv(l, m), sv(m, r), i=m, j=l; i<r; i++) {
		for (; j<m && a[j].b<=a[i].b; j++)
			if (!~a[j].i) ad(a[j].c, a[j].k);
		if (~a[i].i) ans[a[i].i] += a[i].k*qr(a[i].c);
	}
	while (j-- > l) if (!~a[j].i) ad(a[j].c, -a[j].k);
	std::inplace_merge(a+l, a+m, a+r, [](el x, el y){return x.b^y.b?x.b<y.b:x.i<y.i;});
}
int main() {
	std::cin >> n >> m;
	for (int i=0, x; i<n; a[tt++]={-1, 0, i, pr[i]=-1, 1}, p[i]={i}, i++)
		std::cin >> x, x ? g[x-1].push_back(i) : void(rt = i);
	auto s = dfs(rt);
	for (int i=1; i<s.size(); i++) {
		for (auto u : p[i-1]) a[tt++] = {-1, i, u, pr[u], -1};
		for (auto[u, v] : rg[i]) p[u].size() < p[v].size()
			? mg(i, p[v], p[u]), p[u].swap(p[v]) : mg(i, p[u], p[v]);
	}
	for (int i=0, l, r, x; i<m; i++) std::cin >> l >> r >> x,
		a[tt++] = {i, x, l-2, l-2, -1}, a[tt++] = {i, x, r-1, l-2, 1};
	std::sort(a, a+tt, [](el x, el y){return x.a^y.a?x.a<y.a:x.i<y.i;}), sv(0, tt);
	for (int i=0; i<m; i++) std::cout << ans[i] << '\n';
}