#include<bits/stdc++.h>

 using namespace std;

 #define LL long long

 #define ULL unsigned LL

 #define fi first

 #define se second

 #define lson l,m,rt<<1

 #define rson m+1,r,rt<<1|1

 #define max3(a,b,c) max(a,max(b,c))

 const int INF = 0x3f3f3f3f;

 const LL mod = 1e9+;

 typedef pair<int,int> pll;

 const int N = 1e5+;

 struct Node{

     int to;

     int nt;

 }e[N<<];

 int head[N], anc[][N], deep[N];

 int tot = ;

 void add(int u, int v){

     e[tot].to = v;

     e[tot].nt = head[u];

     head[u] = tot++;

 }

 void dfs(int u, int o){

     deep[u] = deep[o] + ;

     for(int i = head[u]; ~i; i = e[i].nt){

         if(o != e[i].to){

             anc[][e[i].to] = u;

             for(int j = ; j < ; j++) anc[j][e[i].to] = anc[j-][anc[j-][e[i].to]];

             dfs(e[i].to,u);

         }

     }

 }

 int lca(int u, int v){

     if(deep[u] < deep[v]) swap(u, v);

     for(int i = ; i >= ; i--) if(deep[v] <= deep[anc[i][u]]) u = anc[i][u];

     if(u == v) return v;

     for(int i = ; i >= ; i--) if(anc[i][u] != anc[i][v]) u = anc[i][u], v = anc[i][v];

     return anc[][u];

 }

 int dis(int u, int v)

 {

     return deep[u]+deep[v]-*deep[lca(u,v)];

 }

 int main(){

     int n, m, v;

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

     memset(head, -, sizeof(head));

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

         scanf("%d", &v);

         add(i,v);

         add(v,i);

     }

     dfs(,);

     int a, b, c;

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

         scanf("%d%d%d",&a,&b,&c);

         int t1 = lca(a, b), t2 = lca(b,c), t3 = lca(a,c);

         //cout << t1 <<' ' << t2 << ' ' << t3 << endl;

         if(deep[t1] < deep[t2]) t1 = t2;

         if(deep[t1] < deep[t3]) t1 = t3;

         int ans = max3(dis(t1,a), dis(t1,b), dis(t1,c));

         printf("%d\n",ans+);

     }

     return ;

 }