import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



int N;
int[] A, B;

bool ask(int[] xs) {
  write("?");
  foreach (i; 0 .. N - 1) write(" ", xs[i]);
  writeln;
  stdout.flush;
  const res = readToken;
  if (res == "Invalid") {
    import core.stdc.stdlib;
    exit(0);
  }
  return (res == "Yes");
}

int[][] graph;
int[] dep;
void dfs(int u, int p) {
  foreach (v; graph[u]) if (p != v) {
    dep[v] = dep[u] + 1;
    dfs(v, u);
  }
}

void main() {
  N = readInt;
  A = new int[N - 1];
  B = new int[N - 1];
  foreach (i; 0 .. N - 1) {
    A[i] = readInt;
    B[i] = readInt;
  }
  graph = new int[][N + 1];
  foreach (i; 0 .. N - 1) {
    graph[A[i]] ~= B[i];
    graph[B[i]] ~= A[i];
  }
  dep = new int[N + 1];
  dfs(1, -1);
  
  auto us = iota(1, N + 1).array;
  auto sides = new int[N + 1];
  sides[] = -1;
  foreach (u; 1 .. N + 1) sides[u] = dep[u] & 1;
  for (; ; ) {
    debug {
      writefln("us = %s, sides = %s", us, sides);
    }
    // select 1
    auto xs = new int[N - 1];
    foreach (i; 0 .. N - 1) xs[i] = (sides[A[i]] == 1) ? A[i] : (sides[B[i]] == 1) ? B[i] : A[i];
    const res = ask(xs);
    int[] vs;
    if (res) {
      foreach (u; us) if (sides[u] == 1) vs ~= u;
    } else {
      foreach (u; us) if (sides[u] == 0) vs ~= u;
    }
    us = vs;
    if (us.length == 1) break;
    sides[] = -1;
    foreach (i, u; us) sides[u] = (2 * i >= us.length) ? 1 : 0;
  }
  writeln("! ", us[0]);
  stdout.flush;
}