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

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int n;
	cin >> n;
	vector<vector<int>> fa(21, vector(n + 1, 0));
	vector<int> dep(n + 1);
	for (int i = 2; i <= n; i++) {
		cin >> fa[0][i];
		dep[i] = dep[fa[0][i]] + 1;
	}
	for (int i = 1; i <= 20; i++) {
		for (int j = 1; j <= n; j++) {
			fa[i][j] = fa[i - 1][fa[i - 1][j]];
		}
	}
	auto jump = [&](int x, int k) {
		for (int i = 0; i <= 20; i++) {
			if ((k >> i) & 1) {
				x = fa[i][x];
			}
		}
		return x;
	};
	auto lca = [&](int x, int y) {
		if (dep[x] < dep[y]) {
			swap(x, y);
		}
		x = jump(x, dep[x] - dep[y]);
		if (x == y) {
			return x;
		}
		for (int i = 20; i >= 0; i--) {
			if (fa[i][x] != fa[i][y]) {
				x = fa[i][x], y = fa[i][y];
			}
		}
		return fa[0][x];
	};
	auto check = [&](const vector<int> &v) {
		int m = v.size();
		vector<pair<int, int>> p;
		vector<int> node;
		for (int i = 1; i < m; i++) {
			if (dep[v[i]] < dep[v[i - 1]]) {
				return false;
			}
			if (dep[v[i]] == dep[v[i - 1]]) {
				if (v[i] == v[i - 1]) {
					return false;
				}
				int x = lca(v[i], v[i - 1]), d = dep[v[i]] - dep[x];
				p.emplace_back(jump(v[i - 1], d - 1), jump(v[i], d - 1));
				node.emplace_back(p.back().first);
				node.emplace_back(p.back().second);
			}
		}
		sort(node.begin(), node.end());
		node.erase(unique(node.begin(), node.end()), node.end());
		vector<vector<int>> e(node.size());
		for (auto &[x, y] : p) {
			x = lower_bound(node.begin(), node.end(), x) - node.begin();
			y = lower_bound(node.begin(), node.end(), y) - node.begin();
			e[x].emplace_back(y);
		}
		vector<int> ins(node.size()), vis(node.size());
		auto findcircle = [&](auto &&self, int v) -> bool {
			if (vis[v]) {
				return false;
			}
			ins[v] = vis[v] = true;
			for (auto u : e[v]) {
				if (ins[u]) {
					return true;
				} else if (self(self, u)) {
					return true;
				}
			}
			ins[v] = false;
			return false;
		};
		for (int i = 0; i < (int)node.size(); i++) {
			if (findcircle(findcircle, i)) {
				return false;
			}
		}
		return true;
	};
	int q;
	cin >> q;
	for (int i = 1; i <= q; i++) {
		int m;
		cin >> m;
		vector<int> v(m);
		for (int i = 0; i < m; i++) {
			cin >> v[i];
		}
		cout << (check(v) ? "Yes" : "No") << '\n';
	}
	return 0;
}