#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 1e5 + 10, M = 1e6 + 10, K = N * 100;
int n, m, fa[N], rt, ans[N], s[N], sz[N], son[N];
vector <int> v[N];
struct Q {
	int l, r, x, id;
} q[M], tmpq[M];
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
    size_t operator()(pair <int, int> x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(((uint64_t) x.first << 32 | x.second) + FIXED_RANDOM);
    }
};
void dfs(int x) {
	sz[x] = 1;
	for (int i: v[x]) {
		dfs(i);
		sz[x] += sz[i];
		if (sz[i] > sz[son[x]]) son[x] = i;
	}
}
vector <set <int>> vw[N];
vector <pair <pair <int, int>, int>> tt[N];
int k;
struct O {
	int l, r, x, v;
} o[K], tmpo[K];
void ins(int x, int l, int r, int v) {
	if (l <= r) tt[x].emplace_back(make_pair(l, r), v);
}
void dfs2(int x) {
	if (son[x]) {
		dfs2(son[x]);
		swap(vw[x], vw[son[x]]);
		for (int i: v[x]) if (i != son[x]) {
			dfs2(i);
			while (vw[x].size() < vw[i].size()) vw[x].insert(vw[x].begin(), set <int> {});
			F(j, 0, SZ(vw[i])) {
				int jj = SZ(vw[x]) - (SZ(vw[i]) - j), pos = vw[i].size() - j;
					// if (x == 5) {
					// 	debug << i << ' ' << vw[i][j].size() << endl;
					// }
				int lst = 0;
				for (int k: vw[i][j]) {
					auto it = vw[x][jj].insert(k).first, iit = next(it);
					int l = it == vw[x][jj].begin() ? 1 : * prev(it) + 1, r = iit == vw[x][jj].end() ? n : * iit - 1;
					// if () l = * prev(it) + 1;
					// else l = 1;
					// if (iit == vw[x][jj].end()) r = n;
					// else r = * iit - 1;
					if (l != 1 || r != n) ins(pos, l, r, - 1);
					ins(pos, l, k - 1, 1);
					ins(pos, k + 1, r, 1);
					ins(pos, lst + 1, k - 1, - 1);
					lst = k;
				}
				ins(pos, lst + 1, n, - 1);
			}
			vector <set <int>> ().swap(vw[i]);
		}
	}
	s[vw[x].size()]++;
	vw[x].push_back(set <int> {x});
	ins(1, 1, x - 1, 1);
	ins(1, x + 1, n, 1);
}
int info[N], tim[N], cur;
void mdf(int x, int y) {
	for (; x <= n; x += x & - x)
		if (tim[x] != cur) tim[x] = cur, info[x] = y;
		else info[x] += y;
}
int qry(int x) {
	int s = 0;
	for (; x; x ^= x & - x)
		(tim[x] == cur) && (s += info[x]);
	return s;
}
void cdq(int l1, int r1, int l2, int r2, int l3, int r3) {
	if (l1 > r1 || l2 > r2 || l3 == r3) {
		if (l1 <= r1) {
			sort(q + l1, q + r1 + 1, [&] (Q x, Q y) {
				return x.r < y.r;
			});
		}
		if (l2 <= r2) {
			sort(o + l2, o + r2 + 1, [&] (O x, O y) {
				return x.r < y.r;
			});
		}
		return;
	}
	int mid = (l3 + r3) >> 1;
	F(i, l1, r1) tmpq[i] = q[i];
	// F(i, l2, r2) tmpo[i] = o[i];
	int s1 = l1 - 1;
	F(i, l1, r1)
		if (tmpq[i].x <= mid) q[++s1] = tmpq[i];
	int mid1 = s1;
	F(i, l1, r1)
		if (tmpq[i].x > mid) q[++s1] = tmpq[i];
	// int s2 = l2 - 1;
	int mid2 = l2 - 1;
	F(i, l2, r2)
		if (o[i].x <= mid) mid2++;
	// int mid2 = s2;
	// F(i, l2, r2)
	// 	if (tmpo[i].x > mid) o[++s2] = tmpo[i];
	cdq(l1, mid1, l2, mid2, l3, mid);
	cdq(mid1 + 1, r1, mid2 + 1, r2, mid + 1, r3);
	cur++;
	int pos = mid2;
	DF(i, r1, mid1 + 1) {
		while (pos >= l2 && q[i].r <= o[pos].r) mdf(o[pos].l, o[pos].v), pos--;
		// debug << qry(q[i].l) << " " << q[i].id << " " << pos << " " << mid2 << " " << l2 << endl;
		// if (q[i].id == 2) {
		// 	F(j, pos + 1, mid2) {
		// 		debug << o[j].l << " " << o[j].v << endl;
		// 	}
		// 	debug << q[i].x << " " << mid + 1 << " " << r3 << " " << q[i].l << " " << qry(q[i].l) << endl;
		// }
		ans[q[i].id] -= qry(q[i].l);
	}
	{
		F(i, l1, r1) tmpq[i] = q[i];
		int p1 = l1, p2 = mid1 + 1, pp = l1;
		while (p1 <= mid1 || p2 <= r1) {
			if (p1 <= mid1 && (p2 > r1 || tmpq[p1].r < tmpq[p2].r)) q[pp++] = tmpq[p1++];
			else q[pp++] = tmpq[p2++];
		}
	}
	{
		F(i, l2, r2) tmpo[i] = o[i];
		int p1 = l2, p2 = mid2 + 1, pp = l2;
		while (p1 <= mid2 || p2 <= r2) {
			if (p1 <= mid2 && (p2 > r2 || tmpo[p1].r < tmpo[p2].r)) o[pp++] = tmpo[p1++];
			else o[pp++] = tmpo[p2++];
		}
	}
}
signed main() {
	read(n), read(m);
	F(i, 1, n)
		if (read(fa[i])) v[fa[i]].push_back(i);
		else rt = i;
	dfs(rt), dfs2(rt);
	F(j, 0, SZ(vw[rt])) {
		int pos = vw[rt].size() - j;
			// if (x == 5) {
			// 	debug << i << ' ' << vw[i][j].size() << endl;
			// }
		int lst = 0;
		for (int k: vw[rt][j]) {
			ins(pos, lst + 1, k - 1, - 1);
			lst = k;
		}
		ins(pos, lst + 1, n, - 1);
	}
	F(i, 1, n) {
		unordered_map <pair <int, int>, int, custom_hash> id;
		for (auto [a, b]: tt[i]) id[a] += b;
		// tt[i].clear();
		vector <pair <pair <int, int>, int>> ().swap(tt[i]);
		for (auto [a, b]: id)
			if (b) o[++k] = {a.first, a.second, i - 1, b};//, debug << i << " " << a.first << ' ' << a.second << ' ' << b << endl;
	}
	DF(i, n, 1) s[i] += s[i + 1];
	F(i, 1, m) read(q[i].l), read(q[i].r), ans[i] = s[read(q[i].x)], q[i].id = i;
	// F(i, 1, m) debug << ans[i] << '\n';
	cdq(1, m, 1, k, 0, n);
	F(i, 1, m) cout << ans[i] << '\n';
	return 0;
}
/* why?
*/