#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-10;
const int inf = 2000000000;
const int MOD = 1000000007;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
  return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
  return n | (1LL << i);
  ;
}
inline long long int resetBit(long long int n, long long int i) {
  return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long int modMul(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long int modSub(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1LL;
  }
  return r;
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modPow(b, MOD - 2));
}
bool comp(const pair<long long int, pair<long long int, long long int> > &p1,
          const pair<long long int, pair<long long int, long long int> > &p2) {
  return p1.first > p2.first;
}
long long int converter(string a) {
  long long int i, mul = 1, r, t, ans = 0LL;
  if (a.length() == 0) return 0;
  for (i = a.length() - 1; i >= 0; i--) {
    t = a[i] - '0';
    r = t % 10;
    ans += (mul * r);
    mul = mul * 10;
  }
  return ans;
}
vector<int> adj[100005];
int par[100005], k_par[100005][30], h[100005], n;
void dfs(int u, int cnt, int p) {
  int v;
  h[u] = cnt;
  for (auto it : adj[u]) {
    int v = it;
    if (v != p) {
      par[v] = u;
      dfs(v, cnt + 1, u);
    }
  }
}
void LCA_build(int x) {
  int i, j;
  par[x] = -1;
  dfs(x, 0, -1);
  for (i = 0; i < n; ++i) k_par[i][0] = par[i];
  for (j = 1; (1 << j) < n; ++j) {
    for (i = 0; i < n; ++i) {
      if (k_par[i][j - 1] != -1) {
        k_par[i][j] = k_par[k_par[i][j - 1]][j - 1];
      }
    }
  }
}
int query(int p, int q) {
  if (h[p] < h[q]) swap(p, q);
  int lg = 0, i;
  while (1) {
    if ((1 << (lg + 1)) > h[p]) break;
    lg++;
  }
  for (i = lg; i >= 0; --i) {
    if ((h[p] - (1 << i)) >= h[q]) p = k_par[p][i];
  }
  if (p == q) return q;
  for (i = lg; i >= 0; --i) {
    if (k_par[p][i] != -1 && k_par[p][i] != k_par[q][i]) {
      p = k_par[p][i];
      q = k_par[q][i];
    }
  }
  return par[p];
}
int call(int s, int f, int t) {
  int big1 = query(s, f);
  int big2 = query(t, f);
  if (big1 == big2) {
    int cur = query(s, t);
    if (cur == s || cur == t) {
      int val1 = abs(h[big1] - h[s]) + abs(h[big1] - h[f]) + 1;
      int val2 = abs(h[big1] - h[t]) + abs(h[big1] - h[f]) + 1;
      return min(val1, val2);
    } else {
      return abs(h[big1] - h[f]) + abs(h[cur] - h[big1]) + 1;
    }
  }
  int cur1 = abs(h[big1] - h[f]) + 1;
  int cur2 = abs(h[big2] - h[f]) + 1;
  return min(cur1, cur2);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int q, i, s, f, t;
  cin >> n >> q;
  for (i = 2; i <= n; ++i) {
    int x, y;
    cin >> x;
    y = i;
    --x;
    --y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  LCA_build(0);
  for (i = 1; i <= q; ++i) {
    cin >> s >> f >> t;
    --s;
    --f;
    --t;
    cout << max(call(s, f, t), max(call(s, t, f), call(t, s, f))) << '\n';
  }
  return 0;
}
