#include <bits/stdc++.h>

void charming() {
  int n; std::cin >> n;
  std::vector<int> fa(n), dep(n);
  std::vector<std::vector<int> > G(n);
  for (int i = 1; i < n; ++i) {
    std::cin >> fa[i], --fa[i];
    G[fa[i]].emplace_back(i);
  }

  std::vector<int> que(1, 0);
  for (int i = 0, u; i < n; ++i) {
    u = que[i];
    for (int v : G[u]) {
      que.emplace_back(v);
      dep[v] = dep[u] + 1;
    }
  }

  int q; std::cin >> q;
  for (int i = 0, m; i < q; ++i) {
    std::cin >> m;
    std::vector<int> vec(m);
    for (int j = 0; j < m; ++j) std::cin >> vec[j], --vec[j];
    bool ok = true;
    for (int j = 1; j < m; ++j) {
      if (dep[vec[j]] < dep[vec[j - 1]]) {
        ok = false;
        break;
      }
    }
    if (ok) std::cout << "Yes\n";
    else std::cout << "No\n";
  }
}

signed main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  charming();
  return 0;
}