E. Tree Queries

#include <bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
//思路：dfn序模板题
//要满足每个顶点到某条路径的距离<=1,即满足每个顶点的父节点
//一定在某条路径上,用dfn序按深度从小到大遍历即可
const int inf=0x7fffffffffffffff;
const int N=2e5+10,mod=998244353;
mt19937_64 rng(random_device{}());
vector<int> he(N),ne,to;
void add(int a,int b){
    ne.push_back(he[a]);
    to.push_back(b);
    he[a]=ne.size()-1;
}
int siz[N],dep[N],dfn[N],fa[N],cnt=1;
void dfs(int cur,int pre){
    fa[cur]=pre;
    dep[cur]=dep[pre]+1;
    dfn[cur]=cnt++;
    siz[cur]=1;
    for(int i=he[cur];~i;i=ne[i]){
        if(to[i]!=pre){
            dfs(to[i],cur);
            siz[cur]+=siz[to[i]];
        }
    }
}
void solve() {
    int n,q;cin>>n>>q;
    he.assign(n+1,-1);
    for(int i=0,a,b;i<n-1;i++){
        cin>>a>>b;
        add(a,b),add(b,a);
    }
    dfs(1,1);
    for(int i=0,m;i<q;i++){
        cin>>m;
        vector<array<int,3>>  arr(m);
        for(int j=0,a;j<m;j++){
            cin>>a;
            arr[j][0]=dep[fa[a]];
            arr[j][1]=dfn[fa[a]];
            arr[j][2]=siz[fa[a]];
        }
        sort(arr.begin(),arr.end());
        bool f=true;
        for(int j=0;j<m-1&&f;j++){
            if(arr[j][1]>arr[j+1][1]||arr[j][1]+arr[j][2]<=arr[j+1][1]){
                f=false;
            }
        }
        cout<<(f?"YES":"NO")<<"\n";
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
	//cin>>t;
    while (t--) solve();
	cout.flush(),system("pause");
    return 0;
}