#include <cstdio>
#include <vector>
#include <set>
#include <array>
#include <algorithm>
using namespace std;
int n,m,fa,rt,o1,o2,o3,siz[100005],dep[100005],mxdep[100005],hson[100005],sum[100005],ans[1000005];
vector <int> g[100005];
vector < array <int,6> > op,opl,opr;
set <int> s[100005];
int lowbit(int x){
    return x & -x;
}
void add(int pos,int x){
    if(!pos){
        sum[0] += x;
        return;
    }
    for(;pos <= n;pos += lowbit(pos)){
        sum[pos] += x;
    }
}
int qry(int pos){
    int ret = sum[0];
    for(;pos;pos ^= lowbit(pos)){
        ret += sum[pos];
    }
    return ret;
}
void dfs1(int pos){
    siz[pos] = 1;
    mxdep[pos] = dep[pos];
    for(int i = 0;i < g[pos].size();i++){
        dep[g[pos][i]] = dep[pos] + 1;
        dfs1(g[pos][i]);
        siz[pos] += siz[g[pos][i]];
        mxdep[pos] = max(mxdep[pos],mxdep[g[pos][i]]);
        if(siz[g[pos][i]] > siz[hson[pos]]){
            hson[pos] = g[pos][i];
        }
    }
}
void dfs2(int pos,int x){
    set <int>::iterator it = s[dep[pos]].lower_bound(pos);
    int it2 = 0;
    if(it != s[dep[pos]].begin()){
        it2 = *(--it);
        it++;
    }
    if(it != s[dep[pos]].end()){
        op.push_back((array <int,6>){*it,1,dep[pos] - x,it2,-1,0});
        op.push_back((array <int,6>){*it,1,dep[pos] - x,pos,1,0});
    }
    op.push_back((array <int,6>){pos,1,dep[pos] - x,it2,1,0});
    s[dep[pos]].insert(pos);
    for(int i = 0;i < g[pos].size();i++){
        dfs2(g[pos][i],x);
    }
}
void dfs3(int pos){
    for(int i = 0;i < g[pos].size();i++){
        if(g[pos][i] != hson[pos]){
            dfs3(g[pos][i]);
            for(int j = dep[g[pos][i]];j <= mxdep[g[pos][i]];j++){
                int lst = 0;
                for(set <int>::iterator k = s[j].begin();k != s[j].end();k++){
                    op.push_back((array <int,6>){*k,1,j - dep[pos],lst,-1,0});
                    lst = *k;
                }
                s[j].clear();
            }
        }
    }
    if(hson[pos]){
        dfs3(hson[pos]);
    }
    op.push_back((array <int,6>){pos,1,0,0,1,0});
    s[dep[pos]].insert(pos);
    for(int i = 0;i < g[pos].size();i++){
        if(g[pos][i] != hson[pos]){
            dfs2(g[pos][i],dep[pos]);
        }
    }
}
void solve(int l,int r,int pl,int pr){
    if(l == r){
        return;
    }
    int mid = (l + r) >> 1;
    for(int i = pl;i < pr;i++){
        if(op[i][2] <= mid){
            if(op[i][1] == 1){
                add(op[i][3],op[i][4]);
            }
            opl.push_back(op[i]);
        }
        else{
            if(op[i][1] == 2){
                ans[op[i][5]] += op[i][4] * qry(op[i][3]);
            }
            opr.push_back(op[i]);
        }
    }
    op.clear();
    for(int i = 0;i < opl.size();i++){
        if(opl[i][1] == 1){
            add(opl[i][3],-opl[i][4]);
        }
        op.push_back(opl[i]);
    }
    for(int i = 0;i < opr.size();i++){
        op.push_back(opr[i]);
    }
    int tmp1 = opl.size(),tmp2 = opr.size();
    opl.clear();
    opr.clear();
    solve(l,mid,pl,pl + tmp1);
    solve(mid + 1,r,pl + tmp1,pl + tmp1 + tmp2);
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++){
        scanf("%d",&fa);
        if(fa){
            g[fa].push_back(i);
        }
        else{
            rt = i;
        }
    }
    dfs1(rt);
    dfs3(rt);
    for(int i = dep[rt];i <= mxdep[rt];i++){
        int lst = 0;
        for(set <int>::iterator j = s[i].begin();j != s[i].end();j++){
            op.push_back((array <int,6>){*j,1,i - dep[rt] + 1,lst,-1,0});
            lst = *j;
        }
    }
    for(int i = 1;i <= m;i++){
        scanf("%d%d%d",&o1,&o2,&o3);
        op.push_back((array <int,6>){o1 - 1,2,o3 + 1,o1 - 1,-1,i});
        op.push_back((array <int,6>){o2,2,o3 + 1,o1 - 1,1,i});
    }
    sort(op.begin(),op.end());
    solve(0,n + 1,0,op.size());
    for(int i = 1;i <= m;i++){
        printf("%d\n",ans[i]);
    }
    return 0;
}