#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5; 

int n, ans = -1; 
vector<int> G[N]; 
bool vis[N]; 
int sz[N], mxs[N], rt; 

int ask(int x, vector<int> v) {
    cout << "? " << v.size() << ' ' << x << ' '; 
    for (int i : v) cout << i << ' '; 
    cout << endl; cin >> x; 
    return x; 
}

void froot(int x, int fa, int tot) {
    sz[x] = 1; mxs[x] = 0; 
    for (int y : G[x]) if (y != fa && !vis[y])
        froot(y, x, tot), sz[x] += sz[y], mxs[x] = max(mxs[x], sz[y]); 
    mxs[x] = max(mxs[x], tot - sz[x]); 
    if (mxs[rt] > mxs[x]) rt = x; 
}

void solve(int x) {
    if (ans != -1) return; 
    vector<int> vec; 
    for (int y : G[x]) if (!vis[y]) vec.emplace_back(y); 
    if (vec.empty()) return ans = x, void(); 
    if (ask(x, vec) == 1) return ans = x, void(); 
    sort(vec.begin(), vec.end(), [&](int u, int v){ return sz[u] < sz[v]; }); 
    vis[x] = 1; 
    int L = 0, R = vec.size() - 1; 
    while (L < R) {
        // int mid = L + R >> 1; // 3 4
        int alsz = 0; 
        for (int i = L; i <= R; ++i) alsz += sz[vec[i]]; 
        int mnv = 1e9, mid = -1, ds = 0; 
        for (int i = L; i <= R; ++i) {
            if (max(ds, alsz - ds) < mnv) mid = i - 1, mnv = max(ds, alsz - ds); 
            ds += sz[vec[i]]; 
        }
        vector<int> now; 
        for (int i = L; i <= mid; ++i) now.emplace_back(vec[i]); 
        if (ask(x, now) == 1) L = mid + 1; 
        else R = mid; 
        // cerr << L << " " << R << endl; 
    }
    int y = vec[L]; 
    // cerr << "FOUND " << y << endl; 
    int all = sz[y];  
    rt = 0; froot(y, 0, all); froot(rt, 0, all); 
    solve(rt); 
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n; 
    for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v; 
        G[u].emplace_back(v); G[v].emplace_back(u); 
    }
    mxs[0] = 1e9; 
    int all = n; 
    froot(1, 0, all); froot(rt, 0, all); 
    solve(rt); 
    cout << "! " << ans << endl; 
    return 0;
}