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

typedef long long ll;

const int N = 1e5 + 5;
const int B = 18;

struct edge {
	int to, Next;

	edge() {}
	edge(int to, int Next): to(to), Next(Next) {}
} G[N << 1];

int head[N], cnt;

inline void add_edge(int u, int v) {
	G[++cnt] = edge(v, head[u]);
	head[u] = cnt;
}

int n, q, k, fa[N], dep[N], siz[N], f[N][B];

vector <int> vec, tmp;
bitset <N> vis;

inline void dfs(int u) {
	dep[u] = dep[fa[u]] + 1;
	siz[u] = 1;
	for (int i = head[u]; i; i = G[i].Next) {
		int v = G[i].to;
		if (v != fa[u]) {
			fa[v] = u;
			dfs(v);
			siz[u] += siz[v];
		}
	}
}

inline void init() {
	dfs(1);
	for (int i = 1; i <= n; ++i) {
		f[i][0] = fa[i];
	}
	for (int j = 1; j < B; ++j) {
		for (int i = 1; i <= n; ++i) {
			f[i][j] = f[f[i][j - 1]][j - 1];
		}
	}
}

inline int kfa(int u, int k) {
	for (int i = 0; i < B; ++i) {
		if (k & (1 << i)) {
			u = f[u][i];
		}
	}
	return u;
}

inline bool p(int u, int v) {
	if (!u) {
		return false;
	}
	if (dep[u] > dep[v]) {
		return false;
	}
	return kfa(v, dep[v] - dep[u]) == u;
}

inline bool check(int l, int r) {
	int u = vec[l];
	for (int i = l; i <= r; ++i) {
		if (!p(u, vec[i])) {
			return false;
		}
	}
	return true;
}

inline bool solve() {
	for (int i = 0; i < k - 1; ++i) {
		if (fa[vec[i + 1]] != vec[i] && !p(fa[vec[i + 1]], vec[i])) {
			return false;
		}
		if (p(vec[i + 1], vec[i])) {
			return false;
		}
	}
	int pos = 0;
	while (pos < k) {
		int r = min(k - 1, pos + siz[vec[pos]] - 1);
		if (!check(pos, r)) {
			return false;
		}
		for (int i = pos; i <= r; ++i) {
			if (vis[vec[i]]) {
				return false;
			}
		}
		if (r != k - 1) {
			int u = kfa(vec[pos], dep[fa[vec[r + 1]]] - dep[vec[pos]] - 1);
			vis[u] = true;
			tmp.emplace_back(u);
		}
		pos = r + 1;
	}
	return true;
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> q;
	for (int i = 1; i < n; ++i) {
		int u, v;
		cin >> u >> v;
		add_edge(u, v);
		add_edge(v, u);
	}
	init();
	while (q--) {
		cin >> k;
		vec.resize(k);
		bool flg = false;
		for (int i = 0; i < k; ++i) {
			cin >> vec[i];
			flg |= vis[vec[i]];
			vis[vec[i]] = true;
		}
		for (auto u: vec) {
			vis[u] = false;
		}
		if (flg) {
			cout << "No\n";
			continue;
		}
		if (solve()) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
		for (auto u: tmp) {
			vis[u] = false;
		}
		tmp.clear();
	}
	return 0;
}