#include<bits/stdc++.h>
using namespace std;

#define ONLINE
#ifndef ONLINE
char DEBUG_BUFFER[1000];
#define debug(...) {sprintf(DEBUG_BUFFER,##__VA_ARGS__);\
cerr<<"\033[1;36m"<<DEBUG_BUFFER<<"\033[0;2m"<<"\033[0m";}
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()

inline int read(){static int x; scanf("%d",&x); return x;}
inline LL readLL(){static LL x; scanf("%lld",&x); return x;}
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

#define N 250
using Node=bitset<N>;
class LB{ //linear-basis
private:
	array<Node,N>a;
public:
	LB(){init();}
	void init(){
		for(int i=0;i<N;i++){
			a[i].reset();
		}
	}
	bool insert(Node x){
		for(int i=N-1;i>=0;i--){
			if(!x[i]) continue;
			if(!a[i][i]){
				a[i]=x;
				return 1;
			}
			x^=a[i];
		}
		return 0;
	}
};

int n,k,cnt=0;
vector<int>e[N];
LB lb;
Node A[N],node;
LL B[N]={0};
PII qry[N];

void dfs(int s,int u,int fa,int nw){
	node[u]=1;
	debug("s=%d u=%d nw=%d\n",s+1,u+1,nw);
	if(nw==k){
		if(lb.insert(node)){
			A[cnt]=node;
			qry[cnt]={s+1,u+1};
			++cnt;
		}
		goto RET;
	}
	for(auto v:e[u]){
		if(v==fa) continue;
		dfs(s,v,u,nw+1);
	}
	RET:node[u]=0;
}

int main(){
	lb.init(),node.reset();
	scanf("%d%d",&n,&k);
	for(int i=1,u,v;i<n;i++){
		cin>>u>>v;
		--u,--v;
		e[u].push_back(v);
		e[v].push_back(u);
	}
	node[0]=1;
	lb.insert(node);
	A[cnt++]=node;
	node[0]=0;
	for(int i=0;i<n;i++){
		dfs(i,i,0,0);
	}
	debug("cnt=%d\n",cnt);
	if(cnt!=n){
		assert(cnt<n);
		printf("NO\n");
//		if(n>100) cout<<cnt;
		fflush(stdout);
		return 0;
	}
	printf("YES\n? %d",n-1);
	for(int i=1;i<n;i++){
		printf(" %d %d",qry[i].first,qry[i].second);
	}
	cout<<endl;
	for(int i=1;i<n;i++){
		scanf("%lld",&B[i]);
	}
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(A[j][i]){
				swap(A[i],A[j]);
				swap(B[i],B[j]);
				break;
			}
		}
		for(int j=0;j<n;j++){
			if(i==j) continue;
			if(A[j][i]){
				A[j]^=A[i];
				B[j]^=B[i];
			}
		}
	}
	printf("!");
	for(int i=1;i<n;i++){
		printf(" %lld",B[i]);
	}
	cout<<endl;
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/