#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1) 
#define here system("pause")
using namespace std;

const int N = 3e5+5;
const int mod = 1e9+7;
const int INF = 1e15+7;
const double eps = 1e-6;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}

int n, q;
vector<int> g[N];
int f[N][20], dep[N], ask[N<<1];
bool flag;

inline void dfs(int u, int fa){
	f[u][0] = fa;
	dep[u] = dep[fa] + 1;
	for(int i=1;i<20 && f[u][i-1];i++){
		f[u][i] = f[f[u][i-1]][i-1];
	}
	for(auto v:g[u]){
		if(v==fa) continue;
		dfs(v, u);
	}
}

inline int getlca(int u, int v){
	if(dep[u]<dep[v]) swap(u, v);
	for(int i=19;i>=0;i--){
		if(dep[f[u][i]]>=dep[v]) u = f[u][i];
	}
	
	if(u==v) return u;
	for(int i=19;i>=0;i--){
		if(f[u][i]!=f[v][i]) u = f[u][i], v = f[v][i];
	}
	return f[v][0];
}


inline void sol(){
	cin >> n;
	for(int i=2;i<=n;i++){
		cin >> f[i][0];
		g[f[i][0]].push_back(i);
		g[i].push_back(f[i][0]);
	}
	
	dfs(1, 0);
	
	cin >> q;
	while(q--){
		int num;
		cin >> num;
		flag = 1;
		for(int i=1;i<=num;i++){
			cin >> ask[i];
			if(i!=1 && dep[ask[i]] < dep[ask[i-1]]) flag = 0;
		}
		
		if(!flag){
			cout << "No\n";
			continue;
		}
		if(num==1){
			cout << "Yes\n";
			continue;
		}
		
		vector<vector<int>> pd(n+1);
		map<int, pii> deg; // pii -> in & out
		for(int i=2;i<=num;i++){
			if(dep[ask[i-1]]<dep[ask[i]]) continue;
			else if(dep[ask[i-1]]==dep[ask[i]]){
				int a = ask[i-1], b = ask[i];
				for(int j=19;j>=0;j--){
					if(f[j][a] != f[j][b]) a = f[j][a], b = f[j][b];
				}
				
				pd[a].push_back(b);
				deg[a].second++;
				deg[b].first++;
				
				queue<int> q;
				unordered_map<int,int> app;
				bool haveS = 0;
				for(auto k:deg){
					if(k.second.first == 0 && k.second.second != 0){
						q.push(k.first);
						haveS = 1;
					}
				}
				
				while(q.size()){
					int now = q.front();
					q.pop();
					for(int k:pd[now]){
						if(app.count(k)) flag = 0;
						app[k] = 1;
						q.push(k);
					}
				}
				
				
				if(deg.size() && !haveS) flag = 0;
			}
			if(!flag) cout << "No\n";
			else cout << "Yes\n";
		}
	}
}

signed main(){
	IOS;
	int tc = 1;
	while(tc--){
		sol();
	}
	return 0;
}