#include <bits/stdc++.h>
using namespace std;
#define endl '\n'

inline int lg(int x){
    return 31 - __builtin_clz(x); 
}

const int N = 3e5 + 5, M = 5e5 + 5;
int n, q, root = 1, dep[N], m, a[M], cnt[N];
vector<int> e[N], e2[N];
set<int> used;

inline void add(int u, int v){
    e[u].push_back(v);
}

inline void add2(int u, int v){
	used.insert(u);
	used.insert(v);
	cnt[v]++;
	e2[u].push_back(v);
}

namespace LCA{
	int fa[20][N];

	void dfs(int p){
		for (int q : e[p]){
			if (q == fa[0][p]){
				continue;
			}
			dep[q] = dep[p] + 1;
			fa[0][q] = p;
			dfs(q);
		}
	}

	void init(){
		dfs(root);

		for (int j = 1; j <= lg(n - 1); j++){
			for (int i = 1; i <= n; i++){
				fa[j][i] = fa[j - 1][fa[j - 1][i]];
			}
		}
	}

	int lca(int u, int v){
		if (dep[u] < dep[v]){
			swap(u, v);
		}
		while (dep[u] - dep[v]){
			u = fa[lg(dep[u] - dep[v])][u];
		}
		if (u == v){
			return u;
		}
		for (int i = lg(dep[u]); i >= 0; i--){
			if (fa[i][u] != fa[i][v]){
				u = fa[i][u]; v = fa[i][v];
			}
		}
		return fa[0][u];
	}

	inline int get(int u, int v){
		while (dep[u] - dep[v] > 1){
			u = fa[lg(dep[u] - dep[v] - 1)][u];
		}
		return u;
	}
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;
	for (int i = 2, fa; i <= n; i++){
		cin >> fa;
		add(fa, i);
	}

	LCA::init();

	cin >> q;
	while (q--){
		for (int p : used){
			e2[p].clear();
			cnt[p] = 0;
		}
		used.clear();

		cin >> m;
		for (int i = 1; i <= m; i++){
			cin >> a[i];
		}

		bool flag = true;
		for (int i = 2; i <= m && flag; i++){
			int u = a[i - 1], v = a[i];
			if (dep[u] > dep[v]){
				flag = false;
			}else if (dep[u] == dep[v]){
				int w = LCA::lca(u, v);
				int x = LCA::get(u, w), y = LCA::get(v, w);
				add2(x, y);
			}
		}

		if (flag){
			queue<int> que;
			for (int p : used){
				if (!cnt[p]){
					que.push(p);
				}
			}
			while (!que.empty()){
				int p = que.front();
				que.pop();
				for (int q : e2[p]){
					cnt[q]--;
					if (!cnt[q]){
						que.push(q);
					}
				}
			}
			for (int p : used){
				if (cnt[p]){
					flag = false;
				}
			}
		}

		if (flag){
			cout << "Yes" << endl;
		}else{
			cout << "No" << endl;
		}
	}

    return 0;
}