#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

vi G[MAX];
int de[MAX],par[MAX];

void DFS(int u,int p){
    par[u]=p;
    for(int to:G[u]){
        if(to==p) continue;
        de[to]=de[u]+1;
        DFS(to,u);
    }
}

void solve(int u,int p,vii &ask){
    if(de[u]>=2) ask.pb(mp(par[par[u]],u));
    for(int to:G[u]){
        if(to==p) continue;
        solve(to,u,ask);
    }
}

typedef vector<int> vec;
typedef vector<vec> mat;

vec gauss_jordan(const mat& A,const vec &b){
    int n=A.size();
    mat B(n,vec(n+1));
    
    for(int i=0;i<n;i++) for(int j=0;j<n;j++) B[i][j]=A[i][j];
    
    for(int i=0;i<n;i++) B[i][n]=b[i];
    
    int rank=0;
    
    for(int j=0;j<n;j++){
        int pivot=-1;
        
        for(int i=rank;i<n;i++){
            if(B[i][j]){
                pivot=i;
                break;
            }
        }
        
        if(pivot==-1) continue;
        
        swap(B[pivot],B[rank]);
        
        for(int i=0;i<n;i++){
            if(i!=rank){
                if(B[i][j]){
                    for(int k=0;k<=n;k++) B[i][k]^=B[rank][k];
                }
            }
        }
        
        rank++;
    }
    
    bool ok=true;
    
    for(int i=rank;i<n;i++){
        if(B[i][n]) ok=false;
    }
    
    if(!ok) return vec();
    
    vec x(n);
    
    for(int i=0;i<rank;i++) x[i]=B[i][n];
    return x;
}

int main(){
    
    int N,K;cin>>N>>K;
    for(int i=0;i<N-1;i++){
        int a,b;cin>>a>>b;a--;b--;
        G[a].pb(b);
        G[b].pb(a);
    }
    DFS(0,-1);
    
    if(K==1){
        cout<<"YES"<<endl;
        vii ask;
        for(int i=1;i<N;i++){
            ask.pb(mp(par[i],i));
        }
        cout<<"? "<<si(ask);
        for(auto [a,b]:ask) cout<<" "<<a+1<<" "<<b+1;
        cout<<endl;
        vi res;
        for(int i=0;i<si(ask);i++){
            int x;cin>>x;
            res.pb(x);
        }
        vi ans(N);
        for(int i=0;i<si(ask);i++){
            ans[ask[i].se]=ans[ask[i].fi]^res[i];
        }
        cout<<"!";
        for(int i=1;i<N;i++){
            cout<<" "<<ans[i];
        }
        cout<<endl;
    }else if(K>=3){
        cout<<"NO"<<endl;
    }else{
        int tane=-1;
        for(int i=0;i<N;i++){
            if(de[i]==2&&si(G[i])>=3){
                tane=i;
            }
        }
        if(tane==-1){
            cout<<"NO"<<endl;
        }else{
            cout<<"YES"<<endl;
            vii ask;
            vi X;
            for(int to:G[tane]){
                if(to==par[tane]) continue;
                X.pb(to);
            }
            ask.pb(mp(0,tane));
            ask.pb(mp(par[tane],X[0]));
            ask.pb(mp(par[tane],X[1]));
            ask.pb(mp(X[0],X[1]));
            int Z=par[tane];
            for(int to:G[Z]){
                if(to==0||to==tane) continue;
                solve(to,Z,ask);
            }
            for(int to:G[0]){
                if(to==Z) continue;
                ask.pb(mp(Z,to));
                solve(to,0,ask);
            }
            for(int to:G[tane]){
                if(to==X[0]||to==X[1]||to==par[tane]) continue;
                solve(to,tane,ask);
            }
            for(int to:G[X[0]]){
                if(to==tane) continue;
                solve(to,X[0],ask);
            }
            for(int to:G[X[1]]){
                if(to==tane) continue;
                solve(to,X[1],ask);
            }
            cout<<"? "<<si(ask);
            for(auto [a,b]:ask) cout<<" "<<a+1<<" "<<b+1;
            cout<<endl;
            vi res;
            for(int i=0;i<si(ask);i++){
                int x;cin>>x;
                res.pb(x);
            }
            mat A(si(ask),vi(N-1));
            for(int i=0;i<si(ask);i++){
                int a=ask[i].fi,b=ask[i].se;
                if(de[b]>=2&&par[par[b]]==a){
                    int x=a,y=par[b],z=b;
                    if(x) A[i][x-1]=1;
                    if(y) A[i][y-1]=1;
                    if(z) A[i][z-1]=1;
                }else{
                    int x=a,y=b,z=par[a];
                    assert(par[b]==z);
                    if(x) A[i][x-1]=1;
                    if(y) A[i][y-1]=1;
                    if(z) A[i][z-1]=1;
                }
            }
            cout<<"!";
            auto ress=gauss_jordan(A,res);
            for(int i=0;i<N-1;i++) cout<<" "<<ress[i];
            cout<<endl;
        }
    }
}