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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;


int main(){
  int N;
  cin>>N;
  using ai2 = array<int,2>;
  vector<ai2> E(N-1);
  vector<vi> Ki(N);
  rep(i,N-1){
    cin>>E[i][0]>>E[i][1];
    --E[i][0],--E[i][1];
    Ki[E[i][0]].eb(E[i][1]);
    Ki[E[i][1]].eb(E[i][0]);
  }
  vi dist(N,N+1);
  {
    dist[0]=0;
    queue<int>bfs;
    bfs.push(0);
    while(!bfs.empty()){
      int v=bfs.front();
      bfs.pop();
      for(auto i:Ki[v]){
        if(dist[i]>dist[v]+1){
          dist[i]=dist[v]+1;
          bfs.push(i);
        }
      }
    }
  }
  rep(i,N-1){
    if(dist[E[i][0]]%2){
      swap(E[i][0],E[i][1]);
    }
  }

  // even or odd
  cout<<"?";
  rep(i,N-1){
    cout<<" "<<(E[i][0]+1);
  }
  cout<<endl;
  string res;
  cin>>res;
  set<int> tr;
  if(res=="Yes"){
    rep(i,N-1)tr.insert(E[i][0]);
  }else{
    rep(i,N-1)tr.insert(E[i][1]);
  }
  while(sz(tr)>1){
    vi c;
    c.reserve(sz(tr));
    fore(i,tr)c.push_back(i);
    set<int> tr2;
    rep(i,sz(c)/2)tr2.insert(c[i]);
    cout<<"?";
    rep(i,N-1){
      int t=E[i][0];
      if(tr2.contains(E[i][0]))t=E[i][1];
      if(!tr2.contains(E[i][1])&&tr.contains(E[i][1]))t=E[i][1];
      cout<<" "<<t+1;
    }
    cout<<endl;
    cin>>res;
    if(res=="Yes"){
      fore(i,tr2){
        tr.erase(i);
      }
    }else{
      tr=tr2;
    }
  }
  cout<<"! "<<(*tr.begin())+1<<endl;
}