#include <bits/stdc++.h>

using namespace std;

#define maxn 100005

#define maxm maxn<<2

#define ll long long

#define mod 201314

struct QueryType {

    int now,id,pos,z;

    bool operator<(const QueryType pos)const

    {

        return now<pos.now;

    }

};

struct QueryType qu[maxn<<];

int n,m,f[maxn],top[maxn],lar[maxn],size[maxn],id[maxn],deep[maxn];

int L[maxm],R[maxm],mid[maxm],head[maxn],E[maxn],V[maxn],cnt;

ll dis[maxm],ans[maxn],flag[maxm],Qes;

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'')Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

void dfs1(int now)

{

    size[now]=,deep[now]=deep[f[now]]+;

    for(int i=head[now];i;i=E[i])

    {

        dfs1(V[i]),size[now]+=size[V[i]];

        if(size[lar[now]]<size[V[i]]) lar[now]=V[i];

    }

}

void dfs2(int now,int chain)

{

    top[now]=chain,id[now]=++cnt;

    if(lar[now]) dfs2(lar[now],chain);

    for(int i=head[now];i;i=E[i])

    {

        if(V[i]==lar[now]) continue;

        dfs2(V[i],V[i]);

    }

}

void build(int now,int l,int r)

{

    L[now]=l,R[now]=r;if(l==r) return;mid[now]=l+r>>;

    build(now<<,l,mid[now]),build(now<<|,mid[now]+,r);

}

void downdata(int now)

{

    flag[now<<]+=flag[now],flag[now<<|]+=flag[now];

    dis[now<<]+=flag[now]*(R[now<<]-L[now<<]+);

    dis[now<<|]+=flag[now]*(R[now<<|]-L[now<<|]+);

    flag[now]=;

}

void add(int now,int l,int r)

{

    if(L[now]>=l&&R[now]<=r)

    {

        dis[now]+=R[now]-L[now]+,flag[now]+=;

        return;

    }

    if(flag[now]) downdata(now);

    if(l<=mid[now]) add(now<<,l,r);

    if(r>mid[now]) add(now<<|,l,r);

    dis[now]=dis[now<<]+dis[now<<|];

}

void query(int now,int l,int r)

{

    if(L[now]>=l&&R[now]<=r)

    {

        Qes+=dis[now];return;

    }

    if(flag[now]) downdata(now);

    if(l<=mid[now]) query(now<<,l,r);

    if(r>mid[now]) query(now<<|,l,r);

}

void add(int x,int y)

{

    while(top[x]!=top[y])

    {

        if(deep[top[x]]<deep[top[y]]) add(,id[top[y]],id[y]),y=f[top[y]];

        else add(,id[top[x]],id[x]),x=f[top[x]];

    }

    if(deep[x]>deep[y]) swap(x,y);add(,id[x],id[y]);

}

ll query(int x,int y)

{

    ll res=;

    while(top[x]!=top[y])

    {

        if(deep[top[x]]<deep[top[y]])

        {

            Qes=,query(,id[top[y]],id[y]);

            res+=Qes,y=f[top[y]];

        }

        else

        {

            Qes=,query(,id[top[x]],id[x]);

            res+=Qes,x=f[top[x]];

        }

    }

    if(deep[x]>deep[y]) swap(x,y);

    Qes=,query(,id[x],id[y]);

    return res+Qes;

}

int main()

{

    freopen("data.txt","r",stdin);

    in(n),in(m);int u,v,w;

    for(int i=;i<=n;i++)

    {

        in(u),u++,f[i]=u;

        E[++cnt]=head[u],V[cnt]=i,head[u]=cnt;

    }

    cnt=,dfs1(),dfs2(,),build(,,n),cnt=;

    for(int i=;i<=m;i++)

    {

        in(u),in(v),in(w),w++;

        qu[++cnt].now=u,qu[cnt].id=i,qu[cnt].pos=-,qu[cnt].z=w;

        qu[++cnt].now=v,qu[cnt].id=i,qu[cnt].pos=,qu[cnt].now++,qu[cnt].z=w;

    }

    sort(qu+,qu+cnt+);int tot=;

    for(int i=;i<=cnt;i++)

    {

        if(qu[i].now==) continue;

        while(tot<qu[i].now) add(++tot,);

        ans[qu[i].id]+=query(qu[i].z,)*qu[i].pos;

    }

    for(int i=;i<=m;i++) printf("%lld\n",ans[i]%mod);

    return ;

}