#include <bits/stdc++.h>
using namespace std;
vector<long long int> adj[200005];
long long int up[200005][25];
long long int tstamp = 0;
long long int d[200005 + 1];
long long int p[200005 + 1];
vector<long long int> time_in(200005 + 1), time_out(200005 + 1);
void binary_lifting(long long int node, long long int par, long long int dist) {
  up[node][0] = par;
  tstamp++;
  d[node] = dist;
  time_in[node] = tstamp;
  p[node] = par;
  for (long long int i = 1; i <= 24; i++) {
    if (up[node][i - 1] != -1) {
      up[node][i] = up[up[node][i - 1]][i - 1];
    } else
      up[node][i] = -1;
  }
  for (auto u : adj[node]) {
    if (u != par) {
      binary_lifting(u, node, dist + 1);
    }
  }
  tstamp++;
  time_out[node] = tstamp;
}
long long int query(long long int node, long long int jump) {
  if (node == -1 || jump == 0) {
    return node;
  }
  for (long long int i = 24; i >= 0; i--) {
    if (jump >= (1 << i)) {
      return query(up[node][i], jump - (1 << i));
    }
  }
  return node;
}
bool is_ancestor(long long int u, long long int v) {
  return ((time_in[u] <= time_out[v]) && (time_out[u] >= time_out[v]));
}
long long int LCA(long long int u, long long int v) {
  if (is_ancestor(u, v)) return u;
  if (is_ancestor(v, u)) return v;
  for (long long int i = 24; i >= 0; i--) {
    if (up[u][i] != -1) {
      if (!is_ancestor(up[u][i], v)) u = up[u][i];
    }
  }
  return up[u][0];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int i, j, t;
  long long int n, q;
  cin >> n >> q;
  for (i = 1; i < n; i++) {
    long long int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  binary_lifting(1, -1, 0);
  while (q--) {
    vector<long long int> v;
    long long int k;
    cin >> k;
    long long int Max = 1;
    for (i = 0; i < k; i++) {
      long long int x;
      cin >> x;
      v.push_back(x);
      if (d[Max] < d[x]) Max = x;
    }
    for (i = 0; i < k; i++) {
      if (v[i] != 1) v[i] = p[v[i]];
    }
    bool flag = true;
    for (i = 0; i < k; i++) {
      if (!is_ancestor(v[i], Max)) flag = false;
    }
    if (flag)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return (0);
}
