#include<bits/stdc++.h>
#define fore(i,l,r)	for(int i=(int)(l);i<(int)(r);++i)
#define fi first
#define se second
#define endl '\n'
#define ull unsigned long long
#define ALL(v) v.begin(), v.end()
#define Debug(x, ed) std::cerr << #x << " = " << x << ed;

const int INF=0x3f3f3f3f;
const long long INFLL=1e18;

typedef long long ll;

const int N = 100005;
const int K = 17;

std::vector<int> g[N];
int f[N][K + 1];
int h[N];

void dfs0(int u, int fa){
	h[u] = h[fa] + 1;
	f[u][0] = fa;
	for(int k = 1; (1 << k) <= h[u]; ++k)
		f[u][k] = f[f[u][k - 1]][k - 1];
	for(auto v : g[u])
		if(v != fa)
			dfs0(v, u);
}

int lca(int u, int v){
	if(h[u] < h[v]) std::swap(u, v);
	for(int k = K; k >= 0; --k)
		if(h[u] - (1 << k) >= h[v])
			u = f[u][k];
	if(u == v) return u;
	for(int k = K; k >= 0; --k)
		if(f[u][k] != f[v][k]){
			u = f[u][k];
			v = f[v][k];
		}
	return f[u][0];
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n, q;
    std::cin >> n >> q;
    fore(i, 1, n){
    	int u, v;
    	std::cin >> u >> v;
    	g[u].push_back(v);
    	g[v].push_back(u);
    }
    
    dfs0(1, 0);
    
    std::vector<bool> oc(n + 1);
    
    while(q--){
    	int m;
    	std::cin >> m;
    	std::vector<int> a(m);
    	fore(i, 0, m) std::cin >> a[i];
    	
    	auto check = [&]() -> bool {
    		if(m == 1) return true;
    		oc[a[0]] = oc[1] = true;
    		fore(i, 1, m){
    			int u = a[i - 1], w = a[i];
    			if(oc[w]) return false;
    			oc[w] = true;
    			if(lca(u, f[w][0]) == f[w][0] && lca(u, w) != w)
    				continue;
    			return false;
   		 	}	
   		 	
   		 	return true;
    	};
    	
    	std::cout << (check() ? "Yes" : "No") << endl;
    	for(auto x : a) oc[x] = false;
    }
    
    return 0;
}