#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);

/* -------------------- Constants -------------------- */

const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    if (a > b) return 0ll;
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

ll factorial_by_mod(ll n, ll mod) {
    ll ans = 1;
    ll num;
    for (ll i = 1; i <= n; ++i) {
        num = i % mod;
        ans *= num;
        ans %= mod;
    }
    return ans;
}

bool isPrime(ll a) {
    if (a == 1) return false;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return false;
    }
    return true;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 505;
vi g[N], nodes;

int dfs(int u, int par) {
    int sz = 1;
    for (auto to : g[u]) {
        if (to == par) continue;
        sz += dfs(to, u);
    }
    return sz;
}

bool qry(vi vec) {
    if ((int)vec.size() == 0) return false;
    cout << "? " << (int)vec.size() << " ";
    for (auto elem : vec) {
        cout << elem << " ";
    }
    cout << endl;
    string s;
    cin >> s;
    if (s == "YES") return true;
    return false;
}

void make_it(int u, int par, int need, int dist = 0) {
    if (dist == need) {
        nodes.pub(u);
        return;
    }
    for (auto to : g[u]) {
        if (to == par) continue;
        make_it(to, u, need, dist + 1);
    }
}

void slv() {
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        cin >> x >> y;
        g[x].pub(y);
        g[y].pub(x);
    }
    int mn = MAX, u = 0, gag = 0;
    for (int i = 1; i <= n; ++i) {
        if ((int)g[i].size() <= 2) continue;
        if ((int)g[i].size() < mn) {
            mn = (int)g[i].size();
            u = i;
        }
    }
    vi vec;
    for (auto to : g[u]) {
        vec.pub(to);
    }
    if (!qry(vec)) {
        cout << "! " << u << endl;
        return;
    }
    int l = 0, r = (int)vec.size() - 1, mid;
    vi cur_vec;
    while ((r - l + 1) > 2) {
        mid = (l + r) / 2;
        cur_vec.clear();
        for (int i = l; i <= mid; ++i) {
            cur_vec.pub(vec[i]);
        }
        if (qry(cur_vec)) {
            r = mid;
        }
        else {
            l = mid + 1;
        }
    }
    gag = u;
    if (l == r) {
        u = vec[l];
    }
    else {
        if (qry({ vec[l],(l == 0 ? vec.back() : vec[0]) })) {
            u = vec[l];
        }
        else {
            u = vec[r];
        }
    }
    l = 1, r = 500;
    int final_dist = 0;
    while (l <= r) {
        mid = (l + r) / 2;
        nodes.clear();
        make_it(u, u, mid);
        if (!qry(nodes)) {
            r = mid - 1;
        }
        else {
            final_dist = mid;
            l = mid + 1;
        }
    }
    if (final_dist == 0) {
        cout << "! " << u << endl;
        return;
    }
    vec.clear();
    l = 0, r = (int)nodes.size() - 1;
    while (l < r) {
        mid = (l + r) / 2;
        vec.clear();
        vec.pub(gag);
        for (int i = 0; i <= mid; ++i) {
            vec.pub(nodes[i]);
        }
        if (qry(vec)) {
            r = mid;
        }
        else {
            l = mid + 1;
        }
    }
    cout << "! " << nodes[l] << endl;
    return;
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}