#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int Y,m,pos,a[N],dep[N],anc[N][21],siz[N];
set<int>son[N];
vector<int>G[N];
void Dfs(int u) {
	siz[u]=1;
	for(int i=1;i<=20;i++) anc[u][i]=anc[anc[u][i-1]][i-1];
	for(auto v:G[u]) if(!dep[v]) {
		dep[v]=dep[u]+1;
		son[u].insert(v);
		anc[v][0]=u;//cout<<u<<"     "<<v<<endl;
		Dfs(v); 
		siz[u]+=siz[v];
	}
}
int lca(int u,int v) {
	if(dep[u]>dep[v]) swap(u,v);
	for(int i=20;i>=0;i--) if(dep[anc[v][i]]>=dep[u]) v=anc[v][i];
	if(u==v) return v;
	for(int i=20;i>=0;i--) if(anc[v][i]^anc[u][i]) u=anc[u][i],v=anc[v][i];
	return anc[u][0];
}
void DFS(int u) {
	while(pos<=Y&&son[u].count(a[pos])) {
		DFS(a[pos++]);
	}
}
bool chk1(int x) {
	Y=x+siz[a[x]]-1;
	pos=x+1;
	DFS(a[x]);
	return pos>Y;
} 
bool chk2(int x) {
	for(int j=1;j<x;j++) if(lca(a[j],a[x])==a[x]) return false;
	Y=m;
	pos=x+1;
	DFS(a[x]);
	return pos>Y;
}
void main1() {
	scanf("%d",&m);
	for(int i=1;i<=m;i++) scanf("%d",&a[i]);
	for(int i=1;;) {
		if(i+siz[a[i]]-1>=m) {
        	if(!chk2(i)) puts("No");
			else puts("Yes");
        	return ;
		}
		else {
			//cout<<"flag" <<a[i]<<" "<<a[i+siz[a[i]]]<<" "<<lca(a[i],a[i+siz[a[i]]])<<" "<<anc[a[i+siz[a[i]]]][0]<<endl;
			if(!chk1(i)) return puts("No"),void();
			if(lca(a[i],a[i+siz[a[i]]])!=anc[a[i+siz[a[i]]]][0]) return puts("No"),void();
			i+=siz[a[i]];
		}
	}
}
int main() {
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i=1,u,v;i<n;i++) scanf("%d%d",&u,&v),G[u].push_back(v),G[v].push_back(u);
	dep[1]=1;
	Dfs(1);
	for(int _=1;_<=q;_++) {
		main1();
	}
}