#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool query(vector<int>&v) {
	cout << "?" << " ";
	for (auto e : v)cout << e + 1 << " ";
	cout << endl;
	string s; cin >> s;
	return s == "Yes";
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector to(n, vector<int>());
	vector<P>e(n - 1);
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
		e[i] = { u,v };
	}
	vector<int>col(n, -1);
	vector<bool>cand(n, true);// 候補
	auto dfs = [&](auto &&self, int v, int v2, int p = -1)->void {
		if (cand[v])v2 = v;
		for (auto nv : to[v]) {
			if (p == nv)continue;
			if (cand[nv]) {
				col[nv] = 1 - col[v2];
			}
			self(self, nv, v2, v);
		}
	};
	int ans = -1;
	while (true) {
		vector<int>tar;
		rep(i, n)if (cand[i])tar.push_back(i);
		if (tar.size() == 1) {
			ans = tar.front();
			break;
		}
		col = vector<int>(n, -1);
		col[tar.front()] = 0;
		dfs(dfs, tar.front(), tar.front());
		vector<int>v(n - 1);
		rep(i, n - 1) {
			if (col[e[i].first] == 1)v[i] = e[i].second;
			else v[i] = e[i].first;
		}
		auto b = query(v);
		if (b) {// 0
			rep(i, n)if (col[i] == 1)cand[i] = false;
		}
		else {//1 
			rep(i, n)if (col[i] == 0)cand[i] = false;
		}
	}
	cout << "! " << ans + 1 << endl;
	return 0;
	// 半分になるか？？ならんやろ
}