#include <bits/stdc++.h>
#define file_in(x) (freopen(#x".in", "r", stdin))
#define file_out(x) (freopen(#x".out", "w", stdout))
#define ll long long
#define ull unsigned long long
#define vi vector
#define pr pair <int, int>
#define fi first
#define se second
#define mk make_pair
#define pb push_back
#define ls(p) (p << 1)
#define rs(p) ((p << 1) | 1)

using namespace std;

char _c; bool _f; template <class T> void IN(T & x) {
  _f = x = 0; while (_c = getchar(), !isdigit(_c)) {if (_c == '-') _f = 1;}
  while (isdigit(_c)) {x = x * 10 + _c - '0', _c = getchar();} if (_f) x = -x;
}
template <class T> void _write(T x) {
  if (x < 0) return putchar('-'), _write(-x), void();
  if (x > 9) _write(x / 10);
  putchar('0' + x % 10);
}
template <class T> void write_s(T x) {_write(x), putchar(' ');}
template <class T> void write(T x) {_write(x), putchar('\n');}
template <class first, class... rest> void write(first fir, rest... res) {
  write_s(fir), write(res...);
}
#define debug(...) (_debug(#__VA_ARGS__, __VA_ARGS__))
template <class T> void _debug(const char * format, T x) {
  cerr << format << " = " << x << endl;
}
template <class first, class... rest>
void _debug(const char * format, first fir, rest... res) {
  while (*format != ',') cerr << *format++;
  cerr << " = " << fir << ',', _debug(format + 1, res...);
}

bool START;

const int N = 1e5 + 5, M = 1e6 + 5, B = 316;

int n, m, rt, FA[N], dep[N], p[N][2], dfn[N], sz[N], idx, mxd, ans[M];
int lg[M];
int dfn2[N << 1], st[20][N << 1], idx2;
int pre[N], nxt[N];
int tot;
bool exi[N];
vi <int> G[N], d[N];

int a[N], s[N];

struct qry {
  int l, r, x, id;
  bool operator < (const qry & o) const {
    if (l / B != o.l / B) return l < o.l;
    return r > o.r;
  }
} q[M];

struct node {
  int x, y, z;
} stk[N];

bool END;

void add_e(int x, int y) {G[x].pb(y);}

void dfs(int x, int fa) {
  dep[x] = dep[fa] + 1, dfn[x] = ++idx, sz[x] = 1, d[dep[x]].pb(x);
  //  debug(x, dep[x]);
  mxd = max(mxd, dep[x]);
  dfn2[++idx2] = x, p[x][0] = idx2;
  for (auto y : G[x]) if (y ^ fa) dfs(y, x), sz[x] += sz[y];
  dfn2[++idx2] = x, p[x][1] = idx2;
}

int lca(int x, int y) {
  if (dep[x] > dep[y]) swap(x, y);
  if (dfn[y] >= dfn[x] && dfn[y] < dfn[x] + sz[x]) return x;
  int l = p[x][0], r = p[y][0]; if (l > r) swap(l, r);
  int k = lg[r - l + 1];
  //  debug(x, y, l, r, k, st[k][l], st[k][r - (1 << k) + 1]);
  x = st[k][l], y = st[k][r - (1 << k) + 1];
  if (dep[x] < dep[y]) return FA[x];
  return FA[y];
}

int calc(int x, int y) {
  if (!y) return 0;
  if (!x) return dep[y] - 1;
  int lc = lca(x, y);
  //  debug(x, y, lc);
  return dep[y] - dep[lc] - 1;
}

void add(int x, int k) {if (x > 0) a[x] += k, s[x / B] += k;}

void del(int x, bool tp) {
  int l = pre[x], r = nxt[x];
  add(calc(l, x), -1), add(calc(x, r), -1), nxt[l] = r, pre[r] = l, add(calc(l, r), 1);
  if (tp) stk[++tot] = (node) {l, x, r};
}

void con(int x, int y) {
  nxt[x] = y, pre[y] = x;
  if (y) add(calc(x, y), 1);
}

void init(int l, int r) {

  for (int i = 1; i <= n; ++i) pre[i] = nxt[i] = a[i] = 0;
  for (int i = 1; i <= n / B + 1; ++i) s[i] = 0;

  for (int i = 1; i <= mxd; ++i)
    if (l == 1 || exi[i]) {
      int las = 0;
      for (auto x : d[i]) if (x >= l && x <= r) con(x, las), las = x;
      if (las) con(0, las), exi[i] = 1;
      else exi[i] = 0;
    }
}

void rb() {
  while (tot) {
    int x = stk[tot].x, y = stk[tot].y, z = stk[tot].z;
    add(calc(x, z), -1), con(x, y), con(y, z);
    tot--;
  }
}

int ask(int x) {
  int tmp = x / B, lim = mxd / B, sm = 0;
  for (int i = tmp + 1; i <= lim; ++i) sm += s[i];
  for (int i = x; i < (tmp + 1) * B; ++i) sm += a[i];
  return sm;
}

signed main() {
  cerr << (&END - &START) / 1024.0 / 1024.0 << endl;
  for (int i = 2; i < M; ++i) lg[i] = lg[i >> 1] + 1;
  IN(n), IN(m);
  for (int i = 1, x; i <= n; ++i) {
    IN(x), FA[i] = x; if (x) add_e(x, i); else rt = i;
  }
  dfs(rt, 0);
  for (int i = 1; i <= (n << 1); ++i) st[0][i] = dfn2[i];
  for (int i = 1; i < 20; ++i)
    for (int j = 1; j + (1 << i) - 1 <= (n << 1); ++j) {
      int x = st[i - 1][j], y = st[i - 1][j + (1 << (i - 1))];
      if (dep[x] < dep[y]) st[i][j] = x; else st[i][j] = y;
    }
  for (int i = 1; i <= m; ++i) IN(q[i].l), IN(q[i].r), IN(q[i].x), q[i].id = i;
  sort(q + 1, q + 1 + m);

  //  cerr << "$" << endl;

  for (int buf = 0, i = 1; buf * B <= n && i <= m; buf++) {
    int L = max(1, buf * B), R = min(n, (buf + 1) * B - 1);
    if (q[i].l > R) continue;
    //    debug(buf);
    init(L, n);
    int l = L, r = n;
    while (i <= m && q[i].l >= L && q[i].l <= R) {
      while (r > q[i].r) del(r, 0), r--;
      while (l < q[i].l) del(l, 1), l++;
      ans[q[i].id] = ask(q[i].x);
      rb(), i++;
    }
  }
  for (int i = 1; i <= m; ++i) write(ans[i]);
  return 0;
}