#include <bits/stdc++.h>

#include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
#include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>
#include <atcoder/lazysegtree.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	enum State2
	{
		NG,
		UNKNOW
	};
	ll n;
	cin >> n;
	vector<pair<ll, ll>> uv(n - 1);
	rep(i, n - 1)
	{
		ll u, v;
		cin >> u >> v;
		uv[i] = {u, v};
	}
	vector<vector<State2>> node_states(n - 1, vector<State2>(2, State2::UNKNOW));
	cout << "?";
	rep(i, n - 1) cout << " " << uv[i].first;
	cout << endl;
	string s;
	cin >> s;
	if (s == "Yes")
	{
		rep(i, n - 1)
		{
			node_states[i][1] = State2::NG;
		}
	}
	else
	{
		rep(i, n - 1)
		{
			node_states[i][0] = State2::NG;
		}
	}
	ll l = 0, r = n - 1;
	while (r - l > 1)
	{
		ll m = (l + r) / 2;
		cout << "?";
		rep(i, l)
		{
			cout << " " << (node_states[i][0] == State2::UNKNOW ? uv[i].second : uv[i].first);
		}
		for (ll i = l; i < m; i++)
		{
			if (node_states[i][0] == State2::UNKNOW)
			{
				cout << " " << uv[i].first;
			}
			else
			{
				cout << " " << uv[i].second;
			}
		}
		for (ll i = m; i < r; i++)
		{
			if (node_states[i][0] == State2::NG)
			{
				cout << " " << uv[i].first;
			}
			else
			{
				cout << " " << uv[i].second;
			}
		}
		for (ll i = r; i < n - 1; i++)
		{
			cout << " " << (node_states[i][0] == State2::UNKNOW ? uv[i].second : uv[i].first);
		}
		cout << endl;
		cin >> s;
		if (s == "Yes")
		{
			r = m;
		}
		else
		{
			l = m;
		}
	}
	cout << "! " << (node_states[l][0] == State2::UNKNOW ? uv[l].first : uv[l].second) << endl;
	return 0;
}