#include <bits/stdc++.h>
using namespace std;

int main() {
    static const int maxn = 500010, maxlg = 20;
    int n;
    scanf("%d", &n);
    static int fa[maxn];
    static vector<int> G[maxn];
    for (int i = 2; i <= n; i++) scanf("%d", fa + i), G[fa[i]].push_back(i);
    static int dfn[maxn], dep[maxn];
    static int lg[maxn], st[maxlg][maxn];
    static auto get = [](int u, int v) { return dep[u] < dep[v] ? u : v; };
    static vector<int> vec[maxn];
    function<void(int)> dfs = [&dfs](int u) {
        static int c;
        st[0][dfn[u] = ++c] = fa[u];
        for (int i : G[u]) dep[i] = dep[u] + 1, dfs(i), vec[u].push_back(dfn[i]);
        return;
    };
    dfs(1);
    for (int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
    for (int l = 1; l <= lg[n]; l++)
        for (int i = 1; i + (1 << l) - 1 <= n; i++)
            st[l][i] = get(st[l - 1][i], st[l - 1][i + (1 << (l - 1))]);
    auto lca = [](int u, int v) {
        if (u == v)
            return u;
        u = dfn[u], v = dfn[v];
        if (u > v)
            swap(u, v);
        int Lg = lg[v - (++u) + 1];
        return get(st[Lg][u], st[Lg][v - (1 << Lg) + 1]);
    };
    int q;
    scanf("%d", &q);
    while (q--) {
        int m;
        bool ans = true;
        scanf("%d", &m);
        static int a[maxn];
        for (int i = 1; i <= m; i++) scanf("%d", a + i);
        static bool vis[maxn];
        static vector<int> all;
        static vector<pair<int, int>> G[maxn];
        for (int i = 1; i + 1 <= m; i++) {
            if (dep[a[i]] != dep[a[i + 1]]) {
                ans &= dep[a[i]] < dep[a[i + 1]];
                continue;
            }
            int l = lca(a[i], a[i + 1]);
            if (!vis[l])
                vis[l] = true, all.push_back(l);
            int u = *prev(upper_bound(vec[l].begin(), vec[l].end(), dfn[a[i]]));
            int v = *prev(upper_bound(vec[l].begin(), vec[l].end(), dfn[a[i + 1]]));
            G[l].emplace_back(u, v);
        }
        for (int u : all) {
            vector<int> cur;
            static vector<int> g[maxn];
            static bool v[maxn];
            static int deg[maxn];
            for (auto e : G[u]) {
                if (!v[e.first])
                    v[e.first] = true, cur.push_back(e.first);
                if (!v[e.second])
                    v[e.second] = true, cur.push_back(e.second);
                g[e.first].push_back(e.second), deg[e.second]++;
            }
            int tot = 0;
            queue<int> q;
            for (int i : cur)
                if (!deg[i])
                    q.push(i);
            while (!q.empty()) {
                int u = q.front();
                q.pop(), tot++;
                for (int i : g[u])
                    if (!(--deg[i]))
                        q.push(i);
            }
            ans &= tot == cur.size();
            for (int i : cur) v[i] = false, deg[i] = 0, g[i].clear();
            G[u].clear(), vis[u] = false;
        }
        printf(ans ? "Yes\n" : "No\n");
        all.clear();
    }
    return 0;
}