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

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin >> N;
    vector<pair<int,int>> UV(N-1);
    vector<vector<int>> Graph(N);
    for(int i=0; i<N-1; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        Graph.at(u).push_back(v);
        Graph.at(v).push_back(u);
        UV.at(i) = {u,v};
    }

    int query = 0;
    auto ask = [&](vector<int> X) -> bool {
        if(query == 15) assert(false);
        query++;
        cout << "?";
        for(int i=0; i<N-1; i++){
            cout << " ";
            cout << X.at(i)+1;
        }
        cout << endl;
        string ret; cin >> ret;
        if(ret == "Yes") return true;
        if(ret == "No") return false;
        assert(false);
    };

    vector<int> ord;
    vector<int> depth(N);
    {
        auto dfs = [&](auto dfs,int pos,int back,int dep) -> void {
            ord.push_back(pos); depth.at(pos) = dep;
            for(auto to : Graph.at(pos)) if(to != back) dfs(dfs,to,pos,dep^1); 
        };
        dfs(dfs,0,-1,0);
    }

    vector<int> X(N-1);
    for(int i=0; i<N-1; i++){
        auto [u,v] = UV.at(i);
        if(depth.at(u) == 0) X.at(i) = u;
        else X.at(i) = v;
    }
    bool even = ask(X);
    int low = 0,high = ord.size();
    while(high-low > 1){
        int mid = (high+low)/2;
        vector<bool> OK(N);
        for(int i=0; i<mid; i++){
            int pos = ord.at(i);
            if(even == (depth.at(pos) == 0)) OK.at(pos) = true;
        }
        for(int i=0; i<N-1; i++){
            auto [u,v] = UV.at(i);
            if(even != (depth.at(u) == 0)) swap(u,v);
            if(OK.at(u)) X.at(i) = u;
            else X.at(i) = v; 
        }
        if(ask(X)) high = mid;
        else low = mid;
    } 
    cout << "! " << ord.at(low)+1 << endl;
}