#include <bits/stdc++.h>

using namespace std;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif
//#define int long long
typedef long long ll;

#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,bmi2,fma")

struct lca {
    int n;
    vector<vector<int>> v;
    vector<vector<int>> up;
    vector<int> d;
    vector<int> tin, tout;
    int tt = 0;

    void dfs(int u, int par) {
        tin[u] = tt++;
        if (par == -1) {
            d[u] = 0;
            up[u][0] = u;
        } else {
            d[u] = d[par] + 1;
            up[u][0] = par;
        }
        for (int j = 1; j < 20; j++) {
            up[u][j] = up[up[u][j - 1]][j - 1];
        }
        for (auto i: v[u]) {
            if (i != par) {
                dfs(i, u);
            }
        }
        tout[u] = tt++;
    }

    void init(int root) {
        n = v.size();
        up.resize(n, vector<int>(20));
        tin.resize(n);
        tout.resize(n);
        d.resize(n);
        dfs(root, -1);
    }

    int la(int a, int x) {
        for (int i = 19; i >= 0; i--) {
            if (x >= (1 << i)) {
                x -= (1 << i);
                a = up[a][i];
            }
        }
        return a;
    }

    bool isp(int a, int b) {
        return (tin[a] < tin[b]) && (tout[b] < tout[a]);
    }

    int get(int a, int b) {
        if (isp(a, b)) {
            return a;
        }
        if (isp(b, a)) {
            return b;
        }
        if (a == b) return a;
        for (int i = 19; i >= 0; i--) {
            if (!isp(up[a][i], b)) {
                a = up[a][i];
            }
        }
        return up[a][0];
    }

    int govno(int a, int b) {
        if (!isp(a, b)) {
            return -1;
        }
        int x = d[b] - d[a];
        int c = la(b, x - 1);
        return c;
    }

    int lox(int a, int b){
        int c = get(a, b);
        int ans;
        if(c == b){
            ans = govno(b, a);
        }else{
            ans = up[b][0];
        }
        //cout << "aaaa " << ans << " " << c << endl;
        if(ans != c){
            return -1;
        }else{
            return ans;
        }
    }
};

lca l;
vector<vector<int>> v;

bool reb(int a, int b){
    if(b > v[a].back()){
        return 0;
    }
    return (*lower_bound(v[a].begin(), v[a].end(), b) == b);
} 

bool dfs(int u, int par, int &now, vector<int> &ord){
    if(now >= ord.size()){
        return 1;
    }
    if(ord[now] != u){
        return 0;
    }
    now++;
    if(now >= ord.size()){
        return 1;
    }
    if(v[u].size() > 1){
        bool f = 1;
        int x;
        for(int i = 0; (i < v[u].size() - 1) && f; i++){
            if(now >= ord.size()){
                return 0;
            }
            x = ord[now];
            if(!reb(u, x)){
                return 0;
            }
            f = f && dfs(x, u, now, ord);
        }
        return f;
    }else{
        return 1;
    }
}

bool ___(vector<int> a){
    bool f = 0;
    if(a[0] == 0){
        f = 1;
    }
    sort(a.begin(), a.end());
    for(int i = 0; i + 1 < a.size(); i++){
        if(a[i] == a[i + 1]){
            return 0;
        }
    }
    if(a[0] == 0){
        return f;
    }
    return 1;
}

void solve(){
    int k;
    cin >> k;
    vector<int> ord(k);
    for(int i = 0; i < k; i++){
        cin >> ord[i];
        ord[i]--;
    }
    //////////////
    if(!___(ord)){
        cout << "No\n";
        return;
    }
    /////////////
    int now = 1;
    int x = ord[0];
    int y;
    bool f = 1;
    while(f && (now < ord.size())){
        y = ord[now];
        if(!reb(x, y)){
            //cout << "tttttt " << x << " " << y << endl;
            x = l.lox(x, y);
            //cout << x << endl;
            if(x == -1){
                cout << "No\n";
                return;
            }
        }
        if(l.up[x][0] == y){
            cout << "No\n";
            return;
        }
        f = f && dfs(y, x, now, ord);
    }
    if(f){
        cout << "Yes\n";
    }else{
        cout << "No\n";
    }
}

signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);    
#endif        
    int n, q;
    cin >> n >> q;
    l.v.resize(n);
    v.resize(n);
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        a--;b--;
        l.v[a].push_back(b);
        l.v[b].push_back(a);
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(int i = 0; i < n; i++){
        sort(v[i].begin(), v[i].end());
    }
    l.init(0);
    while(q--){
        solve();
    }
}