#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, u, v, w;
  cin >> n;
  vector<vector<int> > tree(n + 1);
  vector<int> edge(n + 1, 0);
  for (long long i = 0; i < n - 1; ++i) {
    cin >> u >> v;
    tree[u].push_back(v);
    tree[v].push_back(u);
    edge[u]++;
    edge[v]++;
  }
  for (long long i = 0; i < n / 2; ++i) {
    vector<int> leaves;
    for (long long j = 1; j <= n; ++j) {
      if (edge[j] == 1) {
        leaves.push_back(j);
      }
    }
    if (leaves.size() < 2) {
      break;
    }
    u = leaves[0], v = leaves[1];
    cout << '?' << ' ' << u << ' ' << v << endl;
    cout.flush();
    cin >> w;
    if (w == u || w == v) {
      cout << "! " << w << endl;
      cout.flush();
      return 0;
    }
    edge[u] = edge[v] = -1;
    for (auto it : tree[u]) {
      edge[it]--;
    }
    for (auto it : tree[v]) {
      edge[it]--;
    }
  }
  for (long long i = 1; i <= n; ++i) {
    if (edge[i] >= 0) {
      cout << "! " << i << endl;
    }
  }
  return 0;
}
