#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int>p[200005];
int dep[200006],lca[200005][18];
int n,m;
void dfs(int now,int fa){
	dep[now] = dep[fa]+1;lca[now][0] = fa;
	for(int i = 1;i<=17;i++)lca[now][i] = lca[lca[now][i-1]][i-1];
	for(int i =0;i<p[now].size();i++){
		if(p[now][i] == fa)continue;
		dfs(p[now][i],now);
	}return;
}int lcaa(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	int dis = abs(dep[x]-dep[y]);
	for(int i =0;dis;i++,dis>>=1){
		if(dis&1)x = lca[x][i];
	}if(x == y)return x;
	for(int i= 17;i>=0;i--){
		if(lca[x][i]!=lca[y][i]){
			x = lca[x][i],y =lca[y][i];
		}
	}return lca[x][0];
}bool cmp(int x,int y){
	return dep[x]<dep[y];
}
signed main(){
	cin >> n >> m;
	for(int i = 1;i<n;i++){
		int a,b;cin >> a >> b;
		p[a].push_back(b),p[b].push_back(a);
	}dfs(1,1);
	for(int i = 1;i<=m;i++){
		vector<int>p;int k;cin >> k;
		for(int j = 1;j<=k;j++){
			int a;cin >> a;p.push_back(lca[a][0]);
		}sort(p.begin(),p.end(),cmp);
		int ok = 1;
		for(int j =0;j+1<p.size();j++){
			if(lcaa(p[j],p[j+1]) != p[j]){
				ok = 0;break;
			}
		}if(ok)cout << "YES" << '\n';
		else cout << "NO" << '\n';
	}
	return 0;
}