#include <iostream>
#include <cstdio>
#include <set>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define mp(x, y) make_pair(x, y) 
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
const int N = 1e5 + 5;
const int M = 1e6 + 5;

int n, m, rt;
vector<int> e[N];
int fa[N] = {0}, d[N] = {0};
vector<int> res[N]; 
void dfs(int x, int dth) {
	res[d[x] = dth].push_back(x);
	for (auto i: e[x])
		dfs(i, dth + 1);
}

int tot = 0;
struct Node {
	int op, x, y, z, f, id;
	Node (int _op = 0, int _x = 0, int _y = 0, int _z = 0, int _f = 0, int _id = 0) :
		op(_op), x(_x), y(_y), z(_z), f(_f), id(_id) {} 
} a[M * 6], b[M * 6];

int p[N] = {0};//虚树父亲 
set<int> g[N];//虚树节点 

void build(int t) {
	for (auto i: res[t]) {
		if (e[i].size() >= 2 || i == rt) {
			for (auto j: e[i])
				p[j] = i, g[i].insert(j);
		} 
		else {
			if (e[i].size())
				p[e[i][0]] = p[i], g[p[i]].insert(e[i][0]);
			g[p[i]].erase(i);
		}
	}
}
int sz[N] = {0}, chd[N] = {0};
int getsz(int x) {
	sz[x] = g[x].empty(), chd[x] = -1;
	for (auto i: g[x]) {
		sz[x] += getsz(i);
		if (chd[x] == -1 || sz[chd[x]] < sz[i])
			chd[x] = i;
	}
	return chd[x];
}

piii c[M * 2];
int len = 0;

void upd(int x, int t, int cl) {
	if (chd[x] == -1) 
		c[++len] = mp(t, mp(x, cl));
	for (auto i: g[x])
		upd(i, t, cl);
}

int srh(int x, int nw) { 
	if (chd[x] == -1) 
		return x;
	for (auto i: g[x])
		if (i != chd[x])
			srh(i, nw);
	int col = srh(chd[x], nw);
	for (auto i: g[x])
		if (i != chd[x])
			upd(i, nw - d[x], col);
	return col;
}

set<int> pos[N];
int arr[N] = {0};
void initc() {
	c[++len] = mp(0, mp(rt, 0));
	sort(c + 1, c + len + 1);
	for (int i = 1; i <= n; i++) {
		arr[i] = i, pos[i].insert(0), pos[i].insert(i);
		a[++tot] = Node(0, 0, 0, i, 1);
	}
	for (int i = 1; i <= len; i++) {
		int t = c[i].first, x = c[i].second.first, y = c[i].second.second;
	//	printf("at time %d: mdf %d to %d\n", t, x, y);
		auto cur = pos[arr[x]].lower_bound(x);
		cur--;
		int prx = *cur;
		a[++tot] = Node(0, t, *cur, x, -1);
		cur++, cur++;
		if (cur != pos[arr[x]].end()) {
			a[++tot] = Node(0, t, x, *cur, -1);
			a[++tot] = Node(0, t, prx, *cur, 1);
		}
		pos[arr[x]].erase(x);
		arr[x] = y;
		if (arr[x]) {
			pos[arr[x]].insert(x);
			cur = pos[arr[x]].lower_bound(x);
			cur--;
			prx = *cur;
			a[++tot] = Node(0, t, prx, x, 1);
			cur++, cur++;
			if (cur != pos[arr[x]].end()) {
				a[++tot] = Node(0, t, prx, *cur, -1);
				a[++tot] = Node(0, t, x, *cur, 1);
			}
		}
	}
//	for (int i = 1; i <= tot; i++)
//		printf("(%d, %d, %d, v:%d)\n", a[i].x, a[i].y, a[i].z, a[i].f);
}

bool cmp(Node u, Node v) {
	if (u.x != v.x)
		return u.x < v.x;
	if (u.y != v.y)
		return u.y < v.y;
	if (u.z != v.z)
		return u.z < v.z;
	return u.op < v.op;
}

int t[N] = {0};
int lowbit(int x) {
	return x & -x; 
}
void mdf(int x, int v) {
	while (x <= n)
		t[x] += v, x += lowbit(x); 
}
int qry(int x) {
	int ans = 0;
	while (x)
		ans += t[x], x -= lowbit(x);
	return ans;
}
void clr(int x) {
	while (x <= n)
		t[x] = 0, x += lowbit(x);
}

int ans[M] = {0};

void slv(int l, int r) {
	if (l + 1 == r)
		return;
	int mid = (l + r) / 2;
	slv(l, mid), slv(mid, r);
	for (int i = mid, j = l; i < r; i++) {
		while (j < mid && a[j].y < a[i].y) {
			if (a[j].op == 0)
				mdf(a[j].z, a[j].f);
			j++;
		}
		if (a[i].op == 1)
			ans[a[i].id] += a[i].f * qry(a[i].z);
	} 
	for (int i = l; i < mid; i++)
		if (a[i].op == 0)
			clr(a[i].z);
	for (int i = l, j = mid, cur = l; i < mid || j < r; )
		if (j == r || (i < mid && a[i].y < a[j].y))
			b[cur++] = a[i++];
		else
			b[cur++] = a[j++];
	for (int i = l; i < r; i++)
		a[i] = b[i];
}

void show(int x) {
	for (auto i: g[x])
		printf("%d -> %d\n", x, i);
	for (auto i: g[x])
		show(i);	
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &fa[i]);
		if (!fa[i])
			rt = i;
		else	
			e[fa[i]].push_back(i);//, cout << fa[i] << " -> " << i << endl;
	}
	dfs(rt, 1);
	for (int i = 1; res[i + 1].size(); i++) {
	//	printf("d:%d\n", i);
		build(i);
		getsz(rt);
		srh(rt, i + 1);
		upd(rt, i + 1, 0);
	//	show(rt);
	}
	initc();
	for (int i = 1, l, r, k; i <= m; i++) {
		scanf("%d%d%d", &l, &r, &k);
		a[++tot] = Node(1, k, l, l - 1, -1, i);
		a[++tot] = Node(1, k, l, r, 1, i);
	}
	sort(a + 1, a + tot + 1, cmp);
	slv(1, tot + 1);
	for (int i = 1; i <= m; i++)
		printf("%d\n", ans[i]);
	return 0;
}