#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,fma,mmx,avx,tune=native")
using namespace std;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
bool ldequal(long double a, long double b) { return abs(a - b) < 1e-9; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const int N = 1e6 + 1;
vector<int> arr;
vector<int> adj[1001];
int cnt[1001];
void rn() { assert(1 == 0); }
int qry(pair<int, int> x) {
  cout << "? " << x.first << " " << x.second << endl;
  int res;
  cin >> res;
  if (res == -1) rn();
  return res;
}
bool tests = false;
void gen(){};
void solve() {
  int n, u, v;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
    cnt[u]++;
    cnt[v]++;
  }
  set<int> s;
  for (int i = 1; i < n + 1; i++) s.insert(i);
  while (true) {
    if (s.size() == 1) {
      int res = *s.begin();
      cout << "! " << res << endl;
      return;
    }
    vector<int> tmp;
    for (auto x : s)
      if (cnt[x] == 1) tmp.push_back(x);
    u = tmp[0];
    v = tmp[1];
    int res = qry(make_pair(u, v));
    if (res == u || res == v) {
      cout << "! " << res << endl;
      return;
    }
    for (auto x : adj[u]) cnt[x]--;
    for (auto x : adj[v]) cnt[x]--;
    s.erase(u);
    s.erase(v);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  gen();
  long long test = 1;
  if (tests) cin >> test;
  for (int i = 1; i < test + 1; i++) {
    ;
    solve();
    cout << "\n";
  }
  return 0;
}
