#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
using ll = long long;

const int N = 1e5 + 10;
const int sz = 20;

int n, q;
vector<int> t[N];
int dep[N], f[N][sz];

void dfs (int x, int fa) {
    f[x][0] = fa;
    dep[x] = dep[fa] + 1;
    for (int i = 1; i < sz; i ++) {
        f[x][i] = f[f[x][i - 1]][i - 1];
    }
    for (auto y: t[x]) {
        if (y == fa) continue;
        dfs(y, x);
    }
}

int get_lca (int x, int y) {
    for (int i = sz - 1; i >= 0; i --) {
        if (dep[f[x][i]] >= dep[y]) x = f[x][i];
        if (dep[f[y][i]] >= dep[x]) y = f[y][i];
    }
    if (x == y) return x;
    for (int i = sz - 1; i >= 0; i --) {
        if (f[x][i] != f[y][i]) {
            x = f[x][i];
            y = f[y][i];
        }
    }
    return f[x][0];
}

void init () {
    cin >> n >> q;
    for (int i = 1; i < n; i ++) {
        int u, v;
        cin >> u >> v;
        t[u].push_back(v);
        t[v].push_back(u);
    }
}

int a[N];

void solve() {
    init();
    dfs(1, 0);
//    cout << "debug\n";
    while (q --) {
        int k;
        cin >> k;
        for (int i = 1; i <= k; i ++) {
            cin >> a[i];
        }
//        cout << q << ' ' << k << endl;
        bool ok = 1;
        for (int i = 2; i <= k; i ++) {
            int fa = f[a[i]][0];
            int lca = get_lca(a[i - 1], a[i]);
            if (fa != lca) {
                ok = 0;
                break;
            }
        }
        if (ok) cout << "Yes\n";
        else cout << "No\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
//    cin >> _;
    while (_--)
        solve();
    return 0;
}