#include <bits/stdc++.h>
using namespace std;
void read (int &x) {
    char ch = getchar(); x = 0; while (!isdigit(ch)) ch = getchar();
    while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
} const int N = 3e5 + 5, M = 5e5 + 5;
int n;
vector<int> g[N];
#define pb push_back
int d[N], f[20][N], L[N], R[N], id;
void dfs (int x) {
    L[x] = ++id;
    for (int i = 1; i < 20; ++i)
        f[i][x] = f[i - 1][f[i - 1][x]];
    for (int y : g[x]) {
        d[y] = d[x] + 1, f[0][y] = x; dfs (y);
    }
    R[x] = id;
}
int lca (int x, int y) {
    if (d[x] < d[y]) swap (x, y);
    for (int i = 19; i >= 0; --i) if (d[f[i][x]] >= d[y]) x = f[i][x];
    if (x == y) return x;  
    for (int i = 19; i >= 0; --i)
        if (f[i][x] ^ f[i][y]) x = f[i][x], y = f[i][y];
    return f[0][x];
}
int m, a[M];
int cnt, h[N], nxt[M], to[M];
void add (int x, int y) {
    to[++cnt] = y, nxt[cnt] = h[x], h[x] = cnt;
}
vector<int> tmp;
int c[N];
queue<int> q;
void ask () {
    read (m);
    for (int i = 1; i <= m; ++i) read (a[i]);
    for (int x : tmp) h[x] = c[x] = 0; cnt = 0;
    tmp.clear ();
    int num = 0, now = 0;
    for (int i = 2; i <= m; ++i) {
        if (a[i] == a[i - 1] || d[a[i]] < d[a[i - 1]]) return (void) puts ("No");
        if (d[a[i]] == d[a[i - 1]]) {
            int x = a[i], y = a[i - 1], z = lca (x, y);
            for (int i = 19; i >= 0; --i) {
                if (d[f[i][x]] > d[z]) x = f[i][x], y = f[i][y];
            }
            if (c[x] + h[x] == 0) tmp.pb (x), ++num;
            if (c[y] + h[y] == 0) tmp.pb (y), ++num;
            add (x, y), ++c[y];
        }
    }
    for (int x : tmp) if (!c[x]) q.push (x);
    while (!q.empty()) {
        int x = q.front (); q.pop(); ++now;
        for (int i = h[x], y; i; i = nxt[i])
            if ((--c[y = to[i]]) == 0) q.push (y);
    }
    puts (now == num ? "Yes" : "No");
}
signed main() {
    read (n);
    for (int i = 2, x; i <= n; ++i) read (x), g[x].pb (i);
    dfs (1);
    int q; read (q);
    while (q--) ask ();
    return 0;
}