#include <bits/stdc++.h>
using namespace std;
const int maxn=3e5+10;
vector<int>ve[maxn];
int dep[maxn],f[21][maxn];
void dfs(int x,int fa)
{
	dep[x]=dep[fa]+1;
	for(int i=0;i<=19;i++)
		f[i+1][x]=f[i][f[i][x]];
    for(auto it:ve[x])
	{
		if(it==fa) continue;
		f[0][it]=x;
		dfs(it,x);
	}
}
int lca(int x,int y)
{
	if(dep[x]<dep[y]) swap(x,y);
	for(int i=20;i>=0;i--)
	{
		if(dep[f[i][x]]>=dep[y]) x=f[i][x];
		if(x==y) return x;
	}
	for(int i=20;i>=0;i--)
		if(f[i][x]!=f[i][y])
			x=f[i][x],y=f[i][y];
	return f[0][x];
}
int findk(int x,int k){
    for(int i=20;i>=0;i--)if(k>>i&1)x=f[i][x];
    return x;
}
vector<int> ve2[maxn];
int cnt[maxn];
bool check(vector<pair<int,int>> &edges){
    set<int> s;
    for(auto [x,y]:edges)s.insert(x),s.insert(y),ve2[x].push_back(y);
    vector<int> v(s.begin(),s.end());
    for(auto [x,y]:edges)cnt[y]++;
    queue<int> qu;
    for(auto it:v)if(cnt[it]==0)qu.push(it);
    int all=(int)edges.size();
    while(!qu.empty()){
        int x=qu.front();qu.pop();
        for(auto it:ve2[x]){
            if((--cnt[it])==0)qu.push(it);
            all--;
        }
    }
    for(auto it:v)cnt[it]=0,ve2[it].clear();
    return all==0;
}
void solve()
{
    int n;cin>>n;
    for(int i=1;i<=n;i++)ve[i].clear();
    for(int i=2;i<=n;i++){
        int x;cin>>x;
        ve[x].push_back(i);
        ve[i].push_back(x);
    }
    dfs(1,0);
    vector<vector<pair<int,int>>> edges(n+1);
    auto sol = [&]()
    {
        int len;cin>>len;
        vector<int> a(len);
        set<int> s;
        for(int i=0;i<len;i++)cin>>a[i],s.insert(a[i]);
        if((int)s.size()!=len)return "No";
        for(int i=0;i+1<len;i++)if(dep[a[i]]>dep[a[i+1]])return "No";
        vector<int> in;
        for(int i=0;i+1<len;i++)if(dep[a[i]]==dep[a[i+1]]){
            int l=lca(a[i],a[i+1]);
            in.push_back(l);
            edges[l].emplace_back(findk(a[i],dep[a[i]]-dep[l]-1),findk(a[i+1],dep[a[i+1]]-dep[l]-1));
        }
        sort(in.begin(),in.end());
        bool flag=true;
        for(auto it:in)if(!check(edges[it]))flag=false;
        for(auto it:in)edges[it].clear();
        if(flag)return "Yes";
        else return "No";
    };
    int q;cin>>q;
    while(q--){
        cout<<sol()<<"\n";
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T=1;while(T--)solve();
    return 0;
}