#include <bits/stdc++.h>
using namespace std;

constexpr int w = 1 << 19, N = 101145;
int tr[w + N];
vector<int> adj[N];
int st[N], ed[N], dep[N];
int cnt = 0;
int fa[19][N];
int n, q;

void add(int p, int v) {
    for (p += w; p; p >>= 1) {
        tr[p] += v;
    }
}

// 左闭右开
int sum(int l, int r) {
    int ans = 0;
    l += w, r += w;
    while (l < r) {
        if (l & 1) ans += tr[l++];
        if (r & 1) ans += tr[--r];
        l >>= 1, r >>= 1;
    }
    return ans;
}

void dfs(int u, int f) {
    fa[0][u] = f;
    st[u] = cnt++;
    for (int v: adj[u]) {
        if (v == f) continue;
        dep[v] = dep[u] + 1;
        dfs(v, u);
    }
    ed[u] = cnt;
}

int lca(int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    int diff = dep[u] - dep[v];
    for (int b = 18; b >= 0; b--) {
        if (diff >> b & 1) u = fa[b][u];
    }
    for (int b = 18; b >= 0; b--) {
        if (fa[b][u] != fa[b][v]) {
            u = fa[b][u]; v = fa[b][v];
        }
    }
    if (u == v) return u;
    return fa[0][u];
}

void solve() {
    int m; cin >> m;
    vector<int> a(m);
    for (int &x: a) cin >> x, x--;
    add(st[a[0]], 1);
    bool ans = true;
    for (int i = 1; i < m; i++) {
        if (sum(st[a[i]], ed[a[i]])) ans = false;
        if (lca(a[i - 1], a[i]) != fa[0][a[i]]) ans = false;
        if (a[i - 1] != fa[0][a[i]]) {
            for (int u = a[i - 1]; !(st[u] <= st[a[0]] && st[a[0]] < ed[u]) && u != fa[0][a[i]]; u = fa[0][u]) {
                if (sum(st[u], ed[u]) != ed[u] - st[u]) {
                    ans = false;
                    break;
                }
            }
        }
        add(st[a[i]], 1);
    }
    for (int x: a) add(st[x], -1);
    cout << (ans ? "Yes" : "No") << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> q;
    for (int e = 1; e < n; e++) {
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(0, 0);
    for (int b = 1; b < 19; b++) {
        for (int u = 0; u < n; u++)
            fa[b][u] = fa[b - 1][fa[b - 1][u]];
    }
    while (q--) {
        solve();
    }
}