#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n;
    cin >> n;
    vector<int> u(n-1), v(n-1);
    vector<vector<int>> g(n);
    rep(i,n-1) {
        cin >> u[i] >> v[i];
        u[i]--;v[i]--;
        g[u[i]].push_back(v[i]);
        g[v[i]].push_back(u[i]);
    }
    vector<int> dist(n);
    auto dfs = [&](auto dfs, int u, int p=-1) -> void {
        for(int v : g[u]) {
            if(v==p) continue;
            dist[v] = dist[u]+1;
            dfs(dfs, v, u);
        }
    };
    dfs(dfs, 0);
    set<int> a,b;
    rep(i,n) {
        if(dist[i]%2==0) a.insert(i);
        if(dist[i]%2==1) b.insert(i);
    }
    set<int> del;
    rep(j,15) {
        if(a.size()==1 && b.size()==0) break;
        vector<int> vs;
        rep(i,n-1) {
            if(a.count(u[i]) && !b.count(u[i])) vs.push_back(u[i]);
            else if(a.count(v[i]) && !b.count(v[i])) {
                vs.push_back(v[i]);
            }
            else{
                if(del.count(u[i])) vs.push_back(u[i]);
                if(del.count(v[i])) vs.push_back(v[i]);
            }
        }
        cout << "? ";
        rep(i,n-1) cout << vs[i]+1 << " ";
        cout << endl;
        string s;
        cin >> s;
        assert(s!="Invalid");
        dbg(a,b);
        set<int> A,B;
        if(s=="Yes") {
            for(auto t : a) {
                if(A.size()==B.size()) A.insert(t);
                else B.insert(t);
            }
            for(auto d : b) del.insert(d);
        }
        else{
            for(auto t : b) {
                if(A.size()==B.size()) A.insert(t);
                else B.insert(t);
            }
            for(auto d : a) del.insert(d);
        }
        a = A;
        b = B;
        dbg(a,b,del);
    }
    cout << "! " << *a.begin()+1 << endl;
    return 0;
}