#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> G[400005], G2[400005];
int fa[400005][20];
int dep[400005], b[400005];
int LCA(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    for (int i = 19; ~i; i--)
        if (dep[fa[u][i]] >= dep[v]) u = fa[u][i];
    if (u == v) return v;
    for (int i = 19; ~i; i--)
        if (fa[u][i] != fa[v][i]) {
            u = fa[u][i], v = fa[v][i];
        }
    return fa[u][0];
}

int dis(int u, int v) {
    return dep[u] + dep[v] - 2 * dep[LCA(u, v)];
}
int jumpfa(int u, int dis) {
    for (int i = 19; ~i; i--)
        if (dis >= (1 << i)) u = fa[u][i], dis -= (1 << i);
    return u;
}
void dfs(int u) {
    for (int i = 1; i < 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
    for (int v : G[u]) {
        fa[v][0] = u;
        dep[v] = dep[u] + 1;
        dfs(v);
    }
}
int deg[400005];
bool topsort(vector<int> pt) {
    for (int x : pt) deg[x] = 0;
    for (int x : pt) {
        for (int v : G2[x]) deg[v]++;
    }
    queue<int> q;
    int cnt = 0;
    for (int x : pt) {
        if (deg[x] == 0) q.push(x);
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        cnt++;
        for (int v : G2[x]) {
            deg[v]--;
            if (deg[v] == 0) q.push(v);
        }
    }
    return cnt == (int)pt.size();
}
int dd[400005];
void solve() {
    cin >> n;
    for (int i = 2; i <= n; ++i) {
        int x;
        cin >> x, G[x].push_back(i);
    }
    dfs(1);
    // for (int i = 1; i <= n; ++i) cout << dep[i] << endl;
    int q;
    cin >> q;
    for (int tt = 1; tt <= q; ++tt) {
        int m;
        cin >> m;
        vector<int> a(m);
        for (int i = 0; i < m; ++i) cin >> a[i];
        bool flag = 1;
        for (int i = 1; i < m; ++i) {
            if (dep[a[i]] < dep[a[i - 1]]) flag = 0;
        }
        if (flag) {
            vector<int> vis;
            for (int i = 1; i < m; ++i) {
                int x = a[i-1], y = a[i];
                if (dep[x] != dep[y]) continue;
                if (dd[x] == tt) flag = 0;
                dd[x] = tt;
                int Lca = LCA(x, y);
                int xx = jumpfa(x, dep[x] - dep[Lca] - 1), yy = jumpfa(y, dep[y] - dep[Lca] - 1);
                // cout << xx << " " << x << " " << yy << " " << y << " " << Lca << endl;
                G2[xx].push_back(yy);
                vis.push_back(xx);
                vis.push_back(yy);
            }
            if (flag) flag = topsort(vis);
            for (int v : vis) G2[v].clear();
        }
        cout << (flag ? "Yes" : "No") << endl;
    }
}
int main() {
    ios::sync_with_stdio(false);
    int T = 1;
    while (T--) {
        solve();
    }
}