#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
int fa[300005][20],dep[300005],a[500005],in[300005];
vector<int> to[300005];
vector<int> test[300005];
set<int> node;
bool flag;
void dfs(int root,int f){
    dep[root]=dep[f]+1;
    for (int i=1;i<=19;i++) {
        fa[root][i] = fa[fa[root][i-1]][i-1];
    }
    for (auto x:to[root]) {
        if (x == f) continue;
        dfs(x, root);
    }
}
void lca(int x, int y) {
    for (int j = 19; j >= 0; j--) {
        if (fa[x][j] != fa[y][j]) {
            x = fa[x][j];
            y = fa[y][j];
        }
    }
    test[x].push_back(y);
    in[y]++;
    node.insert(x);node.insert(y);
}
bool solve(){
    flag=1;
    int n;
    cin>>n;
    
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=1;i<n;i++){
        if(a[i-1]==a[i]) flag=0;
        if(dep[a[i-1]]>dep[a[i]]) flag=0;
    }
    if(!flag) return 0;
    
    for(int i=1;i<n;i++){
        if(dep[a[i-1]]<dep[a[i]]) continue;
        lca(a[i-1],a[i]);
    }
    deque<int> que;
    
    for(auto x:node){
        if(!in[x]) que.push_back(x);
    }
    while(!que.empty()){
        int x = que.front();
        que.pop_front();
        for (auto y : test[x]) {
            in[y]--;
            if (!in[y]) que.push_back(y);
        }
    }
    for(auto x:node){
        if(in[x]) flag=0;
        in[x]=0;test[x].clear();
    }
    node.clear();
    return flag;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,q;
    cin>>n;
    for(int i=2;i<=n;i++){
        cin>>fa[i][0];
        to[fa[i][0]].push_back(i);
    }
    dfs(1,0);
    cin>>q;
    while(q--) cout<<(solve()?"Yes":"No")<<endl;
    return 0;
}