#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
using namespace std;
const int N = 1e6 + 7;
const int M = 2e7 + 7;
template < int N > struct stlca {
	int n;
	int ehd[N], ev[N * 2], enx[N * 2], ew[N * 2], eid;
	void Eadd(int u, int v, int w) {
		enx[++eid] = ehd[u], ev[eid] = v, ew[eid] = w, ehd[u] = eid;
	}
	void add(int u, int v, int w) {
		Eadd(u, v, w);
		Eadd(v, u, w);
	}
	int q[N], s[N], fa[N], top;
	ll dep[N];
	int cs[20][N], up[20][N];
	void dfs1(int x) {
		++top, cs[0][q[x] = top] = fa[x];
		up[0][x] = fa[x];
		L(i, 1, 19) {
			up[i][x] = up[i - 1][up[i - 1][x]];
		}
		for(int i = ehd[x]; i; i = enx[i]) if(ev[i] != fa[x]) 
			dep[ev[i]] = dep[x] + ew[i], fa[ev[i]] = x, dfs1(ev[i]);
	}
	inline int cmin(int &x, int &y) {
		return dep[x] < dep[y] ? x : y;
	}
	int lca(int l, int r) {
		if(l == r) return l;
		l = q[l], r = q[r];
		if(l > r) swap(l, r);
		++l;
		int p = __lg(r - l + 1);
		return cmin(cs[p][l], cs[p][r - (1 << p) + 1]);
	}
	int jump(int x, int k) {
		R(i, 19, 0) {
			if(k >> i & 1) {
				x = up[i][x];
			}
		}
		return x;
	}
	inline ll dis(int x, int y) { 
		return dep[x] + dep[y] - 2 * dep[lca(x, y)];
	}
	void mk(int xn) {
		n = xn, dfs1(1);
		L(i, 1, 19) L(j, 1, top - (1 << i) + 1) 
			cs[i][j] = cmin(cs[i - 1][j], cs[i - 1][j + (1 << (i - 1))]);
	}
	void clear() {
		L(i, 1, n) ehd[i] = 0, fa[i] = 0;
		top = 0, n = 0, eid = 0;
	}
} ;
stlca < N > st;

int n, fa[N], dep[N];
set<int>use;
int deg[N];
vi e[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 2, n) {
		cin >> fa[i];
		dep[i] = dep[fa[i]] + 1;
		st.add(fa[i], i, 1);
	}
	st.mk(n);
	int q;
	cin >> q;
	while(q--) {
		int len;
		cin >> len;
		vi a(len);
		int win = 1;
		L(i, 0, len - 1) {
			cin >> a[i];
		}
		use.clear();
		L(i, 0, len - 2) {
			win &= dep[a[i]] <= dep[a[i + 1]];
			if(a[i] == a[i + 1]) {
				win = 0;
			}
			if(dep[a[i]] == dep[a[i + 1]]) {
				int L = st.lca(a[i], a[i + 1]);
				int u = st.jump(a[i], dep[a[i]] - dep[L] - 1);
				int v = st.jump(a[i + 1], dep[a[i + 1]] - dep[L] - 1);
				use.insert(u);
				use.insert(v);
				e[u].pb(v);
				++deg[v];
			}
		}
		queue<int>q;
		for(auto&u : use) {
			if(!deg[u]) {
				q.push(u);
			}
		}
		int pp = 0;
		while(!q.empty()) {
			int u = q.front();
			q.pop();
			++pp;
			for(auto&v : e[u]) {
				--deg[v];
				if(!deg[v]) {
					q.push(v);
				}
			}
		}
		win &= pp == sz(use);
		for(auto&p : use) {
			deg[p] = 0;
			e[p].clear();
		}
		if(!win) {
			cout << "No\n";
		} else {
			cout << "Yes\n";
		}
	}
	return 0;
}