#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <iostream>

#include <algorithm>

#include <queue>

#define N 51000

#define yu 201314

using namespace std;

struct sss

{

    int place, askp;

    int num, nump;

}ask[N*];

struct ss

{

    int num, push;

}t[N*];

int n, m, nowplace = ;

int p[N], v[N], next[N], bnum = ;

int ans[N][] = {};

int fa[N], deep[N], siz[N], son[N], w[N], top[N];

bool cmp(sss x, sss y) { return x.place < y.place; }

void addbian(int x, int y)

{

    bnum++; next[bnum] = p[x]; p[x] = bnum; v[bnum] = y;

}

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

{

    t[now].num = ; t[now].push = ;

    if (l == r) return; int mid = (l+r)/;

    build_tree(now*, l, mid); build_tree(now*+, mid+, r);

}

void dfs_1(int now, int fat, int de)

{

    int k = p[now]; fa[now] = fat; deep[now] = de;

    int maxsonnum = ; siz[now] = ; son[now] = ;

    while (k)

    {

        if (v[k] != fat)

        {

            dfs_1(v[k], now, de+);

            siz[now] += siz[v[k]];

            if (siz[v[k]] > maxsonnum)

            {

                maxsonnum = siz[v[k]];

                son[now] = v[k];

            }

        }

        k = next[k];

    }

    return;

}

void dfs_2(int now, int fat, int nowtop)

{

    int k = p[now]; top[now] = nowtop; w[now] = ++nowplace;

    if (son[now]) dfs_2(son[now], now, nowtop);

    while (k)

    {

        if (v[k] != son[now] && v[k] != fat)

            dfs_2(v[k], now, v[k]);

        k = next[k];

    }

    return;

}

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

{

    if (!t[now].push) return; int mid = (l+r)/;

    t[now*].push += t[now].push;

    t[now*+].push += t[now].push;

    t[now*].num += (mid-l+) * t[now].push;

    t[now*+].num += (r-mid) * t[now].push;

    if (t[now*].num > yu) t[now*].num %= yu;

    if (t[now*+].num > yu) t[now*+].num %= yu;

    t[now].push = ; return;

}

void tadd(int now, int l, int r, int al, int ar)

{

    if (al <= l && r <= ar)

    {

        t[now].num += r-l+;

        if (t[now].num > yu) t[now].num %= yu;

        t[now].push ++; return;

    }

    int mid = (l+r)/; downdate(now, l, r);

    if (al <= mid) tadd(now*, l, mid, al, ar);

    if (ar > mid) tadd(now*+, mid+, r, al, ar);

    t[now].num = t[now*].num + t[now*+].num;

    if (t[now].num > yu) t[now].num %= yu;

}

int task(int now, int l, int r, int al, int ar)

{

    if (al <= l && r <= ar) return t[now].num;

    int mid = (l+r)/, zans = ; downdate(now, l, r);

    if (al <= mid) zans = task(now*, l, mid, al, ar);

    if (ar > mid) zans += task(now*+, mid+, r, al, ar);

    if (zans > yu) zans %= yu;

    return zans;

}

int askk(int u, int v)

{

    int f1 = top[u], f2 = top[v];

    if (deep[f1] < deep[f2]) { swap(f1, f2); swap(u, v); }

    if (f1 == f2)

    {

        if (u == v) return task(, , n, w[u], w[u]);

        return task(, , n, min(w[u], w[v]), max(w[u], w[v]));

    }

    int zans = task(, , n, w[f1], w[u]);

    zans += askk(fa[f1], v); if (zans > yu) zans %= yu;

    return zans;

}

void add(int u, int v)

{

    int f1 = top[u], f2 = top[v];

    if (deep[f1] < deep[f2]) { swap(f1, f2); swap(u, v); }

    if (f1 == f2)

    {

        if (u == v) tadd(, , n, w[u], w[u]);

        else tadd(, , n, min(w[u], w[v]), max(w[u], w[v]));

        return;

    }

    tadd(, , n, w[f1], w[u]); add(fa[f1], v);

}

int main()

{

    scanf("%d%d", &n, &m); build_tree(, , n);

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

    {

        int x; scanf("%d", &x);

        addbian(x+, i+);

    }

    dfs_1(, , ); dfs_2(, , );

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

    {

        int x, y, z; scanf("%d%d%d", &x, &y, &z); x++; y++; z++;

        ask[i*-].place = x-; ask[i*-].askp = z;

        ask[i*-].num = i; ask[i*-].nump = ;

        ask[i*].place = y; ask[i*].askp = z;

        ask[i*].num = i; ask[i*].nump = ;

    }

    sort(ask+, ask++*m, cmp); int nowplace = ;

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

    {

        while (ask[i].place > nowplace)

        {

            nowplace++;

            add(, nowplace);

        }

        if (ask[i].place)

            ans[ask[i].num][ask[i].nump] = askk(, ask[i].askp);

        else ans[ask[i].num][ask[i].nump] = ;

    }

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

        printf("%d\n", (ans[i][]+yu-ans[i][]) % yu);

    return ;

}