#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ll long long
using namespace std;
const int maxn = 2e5 + 10;
vector<int> G[maxn];
int siz[maxn], fa[maxn];
struct RMQlca {
    int dfn[maxn << 1], tot, st[23][maxn << 1], pos[maxn],
    rev[23][maxn << 1], dep[maxn << 1], lg[maxn << 1];
    void dfs(int u, int deep) {
        dfn[++tot] = u, dep[tot] = deep, pos[u] = tot;
        siz[u] = 1;
        for (auto v : G[u]) {
            if (!pos[v]) {
                fa[v] = u;
                dfs(v, deep + 1);
                siz[u] += siz[v];
                dfn[++tot] = u, dep[tot] = deep;
            }
        }
    }
    void init() {
        for (int i = 2; i <= tot + 1; i++) lg[i] = lg[i >> 1] + 1;
        for (int i = 1; i <= tot; i++) st[0][i] = dep[i], rev[0][i] = dfn[i];
        for (int i = 1; i <= lg[tot]; i++)
            for (int j = 1; j + (1 << i) - 1 <= tot; j++)
                if (st[i - 1][j] < st[i - 1][j + (1 << i - 1)])
                    st[i][j] = st[i - 1][j], rev[i][j] = rev[i - 1][j];
                else
                    st[i][j] = st[i - 1][j + (1 << i - 1)],
                    rev[i][j] = rev[i - 1][j + (1 << i - 1)];
    }
    int LCA2(int l, int r) {
        if (pos[l] > pos[r]) swap(l, r);
        l = pos[l], r = pos[r];
        int k = lg[r - l + 1];
        return st[k][l] < st[k][r + l - (1 << k)] ? rev[k][l] : rev[k][r + 1 - (1 << k)];
    }
} rmqlca;
int LCA(int u, int v) {
    return rmqlca.LCA2(u, v);
}
struct stable {
    vector<vector<int>> mylist;
    int n;
    int (*op) (int a, int b);
    stable(vector<int>&a, int(*f)(int, int)) {
        op = f;
        n = a.size() - 1;
        mylist = vector<vector<int>> (n + 1, vector<int>(__lg(n) + 1));
        for (int i = 1; i <= n; i++) mylist[i][0] = a[i];
        for (int j = 1; j <= __lg(n); j++)
            for (int i = 1; i <= n - (1 << j) + 1; i++)
                mylist[i][j] = op(mylist[i][j - 1], mylist[i + (1 << j - 1)][j - 1]);
    }
    int q(int l, int r) {
        assert(l >= 1 && r <= n && l <= r);
        int len = __lg(r - l + 1);
        return op(mylist[l][len], mylist[r - (1 << len) + 1][len]);
    }
};
void solve() {
    int n, q; cin >> n >> q;
    for (int i = 1; i < n; i++) {
        int u, v; cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    rmqlca.dfs(1, 0);
    rmqlca.init();
    while (q--) {
        int k; cin >> k;
        vector<int> arr(k + 1);
        for (int i = 1; i <= k; i++) cin >> arr[i];
        stable st(arr, LCA);
        int flag = 1;
        for (int i = 1; i < k && flag; i++)
            flag &= LCA(arr[i], arr[i + 1]) == fa[arr[i + 1]];
        for (int i = 1; i <= k && flag; i++) {
            flag &= arr[i] == st.q(i, min(k, i + siz[arr[i]] - 1));
        }
        if (flag) cout << "Yes\n";
        else cout << "No\n";
    }
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}