#include <bits/stdc++.h>
using namespace std;
long long tim = 0, n;
long long parent[20][200000 + 5];
long long tin[200000 + 5], tout[200000 + 5], level[200000 + 5];
vector<long long> g[200000 + 5 + 1];
void dfs(long long k, long long par, long long lvl) {
  tin[k] = ++tim;
  parent[0][k] = par;
  level[k] = lvl;
  for (auto it : g[k]) {
    if (it == par) continue;
    dfs(it, k, lvl + 1);
  }
  tout[k] = tim;
}
long long walk(long long u, long long h) {
  for (long long i = 20 - 1; i >= 0; i--) {
    if ((h >> i) & 1) u = parent[i][u];
  }
  return u;
}
void precompute() {
  for (long long i = 1; i < 20; i++)
    for (long long j = 1; j <= n; j++)
      if (parent[i - 1][j]) parent[i][j] = parent[i - 1][parent[i - 1][j]];
}
long long LCA(long long u, long long v) {
  if (level[u] < level[v]) swap(u, v);
  long long diff = level[u] - level[v];
  for (long long i = 20 - 1; i >= 0; i--) {
    if ((1 << i) & diff) {
      u = parent[i][u];
    }
  }
  if (u == v) return u;
  for (long long i = 20 - 1; i >= 0; i--) {
    if (parent[i][u] && parent[i][u] != parent[i][v]) {
      u = parent[i][u];
      v = parent[i][v];
    }
  }
  return parent[0][u];
}
long long dist(long long u, long long v) {
  return level[u] + level[v] - 2 * level[LCA(u, v)];
}
signed main() {
  long long q;
  cin >> n >> q;
  for (long long i = 0; i < n - 1; i++) {
    long long a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs(1, 0, 0);
  precompute();
  while (q--) {
    long long k;
    cin >> k;
    vector<long long> a;
    long long node = -1;
    long long ma = 0;
    for (long long i = 0; i < k; i++) {
      long long x;
      cin >> x;
      a.push_back(x);
      if (level[x] > ma) {
        ma = level[x];
        node = x;
      }
    }
    if (k == 1) {
      cout << "YES\n";
      continue;
    }
    long long fl = 0;
    for (long long i = 0; i < k; i++) {
      if (a[i] == node) continue;
      long long lca = LCA(a[i], node);
      if (lca == a[i]) continue;
      if (dist(lca, a[i]) == 1) continue;
      fl = 1;
    }
    if (!fl)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
