#include <bits/stdc++.h>
using namespace std;
const long long int MOD = (long long int)1e9 + 7;
vector<vector<long long int> > adj;
vector<vector<long long int> > dp;
vector<long long int> dis;
vector<long long int> vis;
vector<long long int> tin, tout;
long long int n;
long long int l;
long long int timer = 0;
void dfs(long long int p, long long int c) {
  tin[c] = timer++;
  dp[c][0] = p;
  vis[c] = 1;
  for (long long int(i) = 1; (i) <= (l); ++(i)) {
    dp[c][i] = dp[dp[c][i - 1]][i - 1];
  }
  for (auto &&child : adj[c]) {
    if (!vis[child]) {
      dis[child] = dis[c] + 1;
      dfs(c, child);
    }
  }
  tout[c] = timer++;
}
bool is_ances(long long int u, long long int v) {
  return tin[u] <= tin[v] && tout[u] >= tout[v];
}
void solve(vector<long long int> a) {
  long long int far = -1, d = -1;
  for (auto &&i : a) {
    if (dis[i] > d) {
      d = dis[i];
      far = i;
    }
  }
  long long int f = 1;
  for (auto &&nodes : a) {
    if (nodes != far) {
      if (!is_ances(dp[nodes][0], far)) {
        f = 0;
        break;
      }
    }
  }
  if (f)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) {
    long long int x, ans = 0, c = 0, sum = 0;
    long long int q, u, v;
    cin >> n >> q;
    l = ceill(log2(n));
    adj.resize(n + 1);
    dis.resize(n + 1);
    vis.resize(n + 1);
    tin.resize(n + 1);
    tout.resize(n + 1);
    dp.resize(n + 1, vector<long long int>(l + 1));
    for (long long int(i) = 0; (i) < (n - 1); ++(i)) {
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    dfs(1, 1);
    while (q--) {
      long long int k;
      cin >> k;
      vector<long long int> a(k);
      for (long long int(i) = 0; (i) < (k); ++(i)) {
        cin >> a[i];
      }
      solve(a);
    }
  }
}
