求调玄关被hack

#include <bits/stdc++.h>
#define IAKIOI ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define UPB(x, y, z) upper_bound(x + 1, x + y + 1, z) - x
#define LWB(x, y, z) lower_bound(x + 1, x + y + 1, z) - x
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define pre(i, r, l) for (int i = r; i >= l; i--)
#define UNIQUE(x, y) unique(x + 1, x + y + 1)
#define SORT(x, y) sort(x + 1,x + y + 1)
#define pf push_front 
#define pb push_back 
#define IT iterator
#define lowbit(x) x & (-x)
#define re read()
#define wr(n) write(n)
#define sp putchar(' ')
#define endl puts("")

const int N = 1e5 + 10, INF = 1e9;
const double ecnts = 1e-6;

using namespace std;

#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef double db;

int read() {
	int f = 1, y = 0;
	char c = getchar();
	while (!isdigit(c)) {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (isdigit(c)) {
		y = y * 10 + c - '0';
		c = getchar();
	}
	return y * f;
}

void write(int x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) write(x / 10);
	putchar(x % 10 + '0');
}

inline int max(int x, int y) {return x > y ? x : y;}
inline int min(int x, int y) {return x < y ? x : y;}

inline void swap(int &x, int &y) {int t = x;x = y, y = t;}
inline int pow(int x, int y) {
	int ans = 1;
	while (y) {
		if (y & 1) ans *= x;
		x *= x, y = y >> 1;
	}
	return ans;
}

int n, q;
int fa[N][25];
int depth[N];
int maxn[N];
vector<int> g[N];

void dfs(int u) {
	//maxn[v]->u
	for (auto v : g[u]) {
		maxn[v] = max(maxn[v], maxn[u]);
		dfs(v);
	}
}

int lca(int x, int y) {
	if (depth[x] > depth[y]) swap(x, y);
	pre(i, 20, 0) if  (depth[fa[y][i]] >= depth[x]) y = fa[y][i];
	if (x == y) return x;
	pre(i, 20, 0) if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
	return fa[x][0];
}

signed main() {
	IAKIOI
	n = re;
	iota(maxn, maxn + n + 1, 0);
	depth[0] = 0;
	rep(i, 1, n - 1) fa[i][0] = re, depth[i] = depth[fa[i][0]] + 1, g[fa[i][0]].push_back(i);
	rep(i, 1, 20) rep(j, 0, n - 1) fa[j][i] = fa[fa[j][i - 1]][i - 1];
	dfs(0);
	// rep(i, 0, n - 1) wr(maxn[i]), sp;
	// endl;
	q = re;
	while (q--) {
		int k = re - 1;
		int x = re;
		while (k--) {
			int y = re;
			x = lca(x, y);
		}
		wr(maxn[x]), endl;
	}
}