#include <bits/stdc++.h>
using namespace std;
int n, m;
int fa[200005][21], ccnt, nxt[400005], head[200005], to[400005], d[400005], a[200005];
inline void add(int p, int q) {
	nxt[++ccnt] = head[p];
	to[ccnt] = q;
	head[p] = ccnt;
}
inline void dfs(int p, int q) {
	fa[p][0] = q;
	d[p] = d[q] + 1;
	for (int i = 1; i <= 20; i++) {
		fa[p][i] = fa[fa[p][i - 1]][i - 1];
	}
	for (int i = head[p]; i; i = nxt[i]) {
		if (to[i] != q) {
			dfs(to[i], p);
		}
	}
}
inline bool chefa(int p, int q) {
	if (d[p] == d[q]) {
		return (p == q);
	}
	if (d[p] > d[q]) return false;
	for (int i = 20; i >= 0; i--) {
		if (d[fa[q][i]] >= d[p]) q = fa[q][i];
	}
	return (p == q);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	int p, q;
	for (int i = 1; i < n; i++) {
		cin >> p >> q;
		add(p, q), add(q, p);
	}
	dfs(1, 0);

	for (int i = 1; i <= m; i++) {
		cin >> p;
		int minn = 0;
		for (int j = 1; j <= p; j++) {
			cin >> a[j];
			if (a[j] != 1) a[j] = fa[a[j]][0];
			if (d[minn] < d[a[j]]) minn = a[j];
		}
		bool ans = true;
		for (int j = 1; j <= p; j++) {
			ans &= chefa(a[j], minn );
		}
		if (ans) {
			cout << "YES\n";
		} else {
			cout << "NO\n";
		}
	}
}