#include<bits/stdc++.h> 
#define rep(i,p,q) for (ll i=(p);i<=(q);i++)
#define ll long long
#define pb push_back
using namespace std;
const int N=1e5+5; int n; int D[N],sz[N],Fa[N][22]; vector<int>E[N]; map<int,int>m;
int lca(int x,int y) {
	int q=0;
	if (D[x]>D[y]) swap(x,y),q=1;
	for (int i=20;~i;i--) if (D[x]<=D[y]-(1<<i)) y=Fa[y][i];
	if (x==y) return 0;
	for (int i=20;~i;i--) if (Fa[x][i]!=Fa[y][i]) x=Fa[x][i],y=Fa[y][i];
	return q?y:x;
}
void dfs(int x,int fa) {
	int i; D[x]=D[fa]+1,sz[x]=1,Fa[x][0]=fa;
	for (int i=1;(1<<i)<=D[x];i++) Fa[x][i]=Fa[Fa[x][i-1]][i-1];
	for (auto y:E[x]) if (y!=fa) dfs(y,x),sz[x]+=sz[y];
}
int check(int x,int y) {
	if (sz[x]>1) return Fa[y][0]==x;
	int l=lca(x,y),p; if (!l) return 0;
	for (p=y;p;p=Fa[p][0]) if (m[p]) return 0;
	m[l]=1;
	return Fa[l][0]==Fa[y][0];
}
int main() {
	int T,x,y,k,q;
	scanf("%d%d",&n,&T);
	rep(i,1,n-1) scanf("%d%d",&x,&y),E[x].pb(y),E[y].pb(x);
	dfs(1,0);
	//rep(i,1,n) printf("%d %d%c",Fa[i][0],sz[i]," \n"[i==n]);
	for (;T--;) {
		set<int>S; m.clear();
		scanf("%d%d",&k,&x),q=1;
		S.insert(x);
		rep(i,2,k) {
			scanf("%d",&y),S.insert(y);
			if (!check(x,y)||S.size()!=i) q=0;
			x=y;
		}
		//rep(i,1,n) printf("%d%c",m[i]," \n"[i==n]);
		puts(q?"Yes":"No");
	}
}
/*
6 7
1 2
1 3
2 4
3 5
2 6
2 4 1
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
6 1 2 6 4 3 5
*/
/*
7 1
1 2
2 3
2 4
4 5 
4 6
1 7
4 5 6 3 4
*/