#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 300010;

int n, m, k, a[maxn], b[maxn], fa[maxn], st[maxn][20], dep[maxn], deg[maxn];
vector<int> e[maxn], g[maxn];

bool check() {
  rep (i, 1, k) b[i] = a[i];
  sort(b + 1, b + k + 1);
  rep (i, 1, k - 1) if (b[i] == b[i + 1]) return 0;
  rep (i, 1, k - 1) if (dep[a[i]] > dep[a[i + 1]]) return 0;
  set<int> S;
  rep (i, 1, k - 1) if (dep[a[i]] == dep[a[i + 1]]) {
    int u = a[i], v = a[i + 1];
    per (i, 19, 0) if (st[u][i] != st[v][i]) u = st[u][i], v = st[v][i];
    if (!S.count(u)) S.emplace(u), deg[u] = 0, e[u].clear();
    if (!S.count(v)) S.emplace(v), deg[v] = 0, e[v].clear();
    deg[v]++, e[u].emplace_back(v);
  }
  queue<int> q;
  for (int x : S) if (!deg[x]) q.emplace(x);
  int cnt = 0;
  while (!q.empty()) {
    int u = q.front();
    q.pop(), cnt++;
    for (int v : e[u]) if (!(--deg[v])) q.emplace(v);
  }
  return cnt == SZ(S);
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 2, n) cin >> fa[i], e[fa[i]].emplace_back(i);
  rep (i, 1, n) dep[i] = dep[fa[i]] + 1, st[i][0] = fa[i];
  rep (j, 1, 19) rep (i, 1, n) st[i][j] = st[st[i][j - 1]][j - 1];
  cin >> m;
  while (m--) {
    cin >> k;
    rep (i, 1, k) cin >> a[i];
    if (check()) cout << "Yes\n";
    else cout << "No\n";
  }
}