#include <bits/stdc++.h>
using namespace std;
long long ceill(long long a, long long b) { return a / b + bool(a % b); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    x = (x * x) % 1000000007;
    y >>= 1;
  }
  return res;
}
void bin(unsigned n, string &str) {
  str = "";
  if (n > 1) bin(n >> 1, str);
  str += to_string(n & 1);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
void primeFactors(long long n, vector<long long> &vec) {
  while (n % 2 == 0) vec.push_back(2), n /= 2;
  for (long long i = 3; i <= sqrt(n); i += 2)
    while (n % i == 0) vec.push_back(i), n /= i;
  if (n > 2) vec.push_back(n);
}
vector<vector<long long>> graph;
vector<long long> depth, parent, tin, tout;
long long timer;
void dfs(long long node, long long par, long long dep) {
  depth[node] = dep;
  parent[node] = par;
  tin[node] = timer++;
  for (long long child : graph[node]) {
    if (child == par) continue;
    dfs(child, node, dep + 1);
  }
  tout[node] = timer++;
}
bool isanc(long long u, long long v) {
  return (tin[u] <= tin[v] && tout[u] >= tout[v]);
}
void solve() {
  long long n, m;
  cin >> n >> m;
  graph.clear(), depth.clear(), parent.clear(), tin.clear(), tout.clear();
  graph.resize(n);
  depth = parent = tin = tout = vector<long long>(n);
  for (long long i = 0; i < n - 1; i++) {
    long long a, b;
    cin >> a >> b;
    a--, b--;
    graph[a].push_back(b), graph[b].push_back(a);
  }
  timer = 0;
  dfs(0, -1, 0);
  for (long long i = 0; i < m; i++) {
    vector<long long> vec;
    long long k;
    cin >> k;
    for (long long j = 0; j < k; j++) {
      long long tmp;
      cin >> tmp;
      vec.push_back(tmp - 1);
    }
    long long maxx = -1, tnode = -1;
    for (long long node : vec)
      if (depth[node] > maxx) maxx = depth[node], tnode = node;
    for (long long &node : vec) {
      if (node == tnode) continue;
      if (parent[node] != -1) node = parent[node];
    }
    bool flag = 1;
    for (long long node : vec) flag &= isanc(node, tnode);
    if (flag)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long tc = 1;
  for (long long TTT = 1; TTT <= tc; TTT++) {
    solve();
  }
}
