#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for(ll i = (l); i < (r); ++i)
#define all(X) (X).begin(), (X).end()
using ll = long long;

int main() {
    int n, k;
    cin >> n >> k;
    vector<vector<int>> g(n);
    vector<vector<int>> dist(n, vector<int>(n, 10000));
    rep(i, 0, n - 1) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    struct Bit {
        bitset<250> bit;
        int u;
        int v;
    };
    vector<Bit> mat;
    mat.push_back(Bit{bitset<250>(1), -1, -1});
    map<pair<int, int>, bitset<250>> mp;

    auto dfs = [&](auto self, int v, vector<int>& vec) -> void {
        if(vec.size() == k) {
            if(vec[0] < v) {
                bitset<250> bit;
                for(int x : vec) bit.set(x, true);
                bit.set(v, true);
                mat.push_back(Bit{bit, vec[0], v});
                mp[{vec[0], v}] = bit;
            }
        } else {
            int p = -1;
            if(!vec.empty()) p = vec.back();
            vec.push_back(v);
            for(int u : g[v]) {
                if(p != u) {
                    self(self, u, vec);
                }
            }
            vec.pop_back();
        }
    };
    vector<int> tmp;
    rep(i, 0, n) { dfs(dfs, i, tmp); }

    // for(auto [bit, u, v] : mat) {
    //     cout << u << " " << v << endl;
    // }

    int rank = 0;
    rep(j, 0, n) {
        rep(i, rank, mat.size()) {
            if(mat[i].bit[j]) {
                swap(mat[rank], mat[i]);
                break;
            }
        }
        if(mat[rank].bit[j]) {
            rep(i, 0, mat.size()) {
                if(rank != i && mat[i].bit[j]) {
                    mat[i].bit ^= mat[rank].bit;
                }
            }
            rank++;
        }
    }

    if(rank < n) {
        cout << "NO" << endl;
        return 0;
    }

    vector<pair<int, int>> query;
    rep(i, 1, n) {
        auto [bit, u, v] = mat[i];
        query.emplace_back(u, v);
    }

    cout << "YES" << endl;
    cout << "? " << query.size();
    for(auto [u, v] : query) {
        cout << " " << u + 1 << " " << v + 1;
    }
    cout << endl;

    vector<int> res(query.size());
    rep(i, 0, query.size()) cin >> res[i];

    vector<pair<bitset<250>, int>> mat2;
    mat2.emplace_back(bitset<250>(1), 0);
    rep(i, 0, query.size()) {
        auto [u, v] = query[i];
        mat2.emplace_back(mp[{u, v}], res[i]);
    }

    rank = 0;
    rep(j, 0, n) {
        rep(i, rank, mat2.size()) {
            if(mat2[i].first[j]) {
                swap(mat2[rank], mat2[i]);
                break;
            }
        }
        if(mat2[rank].first[j]) {
            rep(i, 0, mat2.size()) {
                if(rank != i && mat2[i].first[j]) {
                    mat2[i].first ^= mat2[rank].first;
                    mat2[i].second ^= mat2[rank].second;
                }
            }
            rank++;
        }
    }

    cout << "!";
    rep(i, 1, n) cout << " " << mat2[i].second;
    cout << endl;
}