#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int INF=2e5+5;
int n,m,sz[INF],son1[INF],fa[INF],dep[INF];
int top1[INF],dfn[INF],pre[INF],A[INF];
vector <int> e[INF];
void DFS(int x) {
    sz[x]=1;
    for (int v:e[x]) {
        dep[v]=dep[x]+1;
        DFS(v);
        sz[x]+=sz[v];
        if (sz[v]>sz[son1[x]]) 
            son1[x]=v;
    }
}
void DFS1(int x,int t) {
    top1[x]=t;dfn[++dfn[0]]=x;pre[x]=dfn[0];
    if (!son1[x]) return ;
    DFS1(son1[x],t);
    for (int v:e[x]) {
        if (v==son1[x]) continue;
        DFS1(v,v);
    }
}
struct P3{
    int l,r,id;
};
vector <P3> e2[INF];
vector < pii > ch[INF];
int num[INF],res[INF];

struct BIT{
    int tree[INF];
    void add(int x,int y) {for (int i=x;i<=1e5;i+=i&-i) tree[i]+=y;}
    int query(int x) {int sum=0;for (int i=x;i;i-=i&-i) sum+=tree[i];return sum;}
}T1;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;int rt=0;
    for (int i=1;i<=n;i++) {
        int x=0;cin>>x;
        fa[i]=x;if (x) e[x].pb(i);else rt=i;
    }
    DFS(rt);
    DFS1(rt,rt);
    for (int i=1;i<=n;i++) A[i]=pre[i];
    for (int i=1;i<=m;i++) {
        int l=0,r=0,k=0;
        cin>>l>>r>>k;
        e2[k].pb({l,r,i});
    }
    for (int x=1;x<=n;x++) {
        int xx=x,d=0;
        while (dep[top1[xx]]) {
            ch[dep[xx]-dep[fa[top1[xx]]]+d].pb({x,pre[fa[top1[xx]]]});
            d+=dep[xx]-dep[fa[top1[xx]]];
            xx=fa[top1[xx]];
        }
        ch[dep[xx]+1+d].pb({x,-1});
    }
    for (int i=1;i<=n;i++) {
        for (pii it:ch[i]) 
            if (it.se==-1) T1.add(it.fi,-1);
            else A[it.fi]=it.se+i;
        for (P3 it:e2[i]) {
            res[it.id]+=it.r-it.l+1+(T1.query(it.r)-T1.query(it.l-1));
            for (int u=it.l;u<=it.r;u++) {
                if (A[u]<=-1) continue;
                if (num[A[u]]) res[it.id]--;
                num[A[u]]=1;
            }
            for (int u=it.l;u<=it.r;u++) {
                if (A[u]<=-1) continue;
                num[A[u]]=0;
            }
        }
    }

    for (int i=1;i<=m;i++) 
        cout<<res[i]<<"\n";
    return 0;
}