#include <bits/stdc++.h>
using namespace std;
set<int> st;
vector<int> T[1001];
void remo(int root, int res) {
  st.insert(root);
  for (int i = 0; i < T[root].size(); ++i) {
    if (T[root][i] != res) remo(T[root][i], root);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; ++i) {
    int a, b;
    cin >> a >> b;
    T[a].push_back(b);
    T[b].push_back(a);
  }
  int numnodes = n;
  set<int> orgset;
  for (int i = 0; i < n; ++i) {
    orgset.insert(i + 1);
  }
  int cnt = 1;
  while (numnodes > 2) {
    int node = -1;
    for (int i = 1; i < n + 1; ++i) {
      if (T[i].size() >= 2) {
        node = i;
        break;
      }
    }
    st.clear();
    vector<int> T1[n + 1];
    cout << "? " << T[node][0] << " " << T[node][1] << endl;
    int res;
    cin >> res;
    if (res == node) {
      remo(T[node][0], node);
      remo(T[node][1], node);
    } else if (res == T[node][0]) {
      remo(node, T[node][0]);
    } else {
      remo(node, T[node][1]);
    }
    int kl = st.size();
    numnodes -= kl;
    for (int i = 1; i < n + 1; ++i) {
      if (st.find(i) != st.end()) {
        orgset.erase(i);
        continue;
      }
      for (int j = 0; j < T[i].size(); ++j) {
        int chld = T[i][j];
        if (st.find(chld) != st.end()) continue;
        T1[i].push_back(chld);
      }
    }
    for (int i = 0; i < n + 1; ++i) {
      T[i] = T1[i];
    }
    cnt++;
  }
  if (numnodes == 1) {
    cout << "! " << *(orgset.begin());
    return 0;
  }
  set<int>::iterator it = orgset.begin();
  int a = *it;
  ++it;
  int b = *it;
  cout << "? " << a << " " << b << endl;
  int res;
  cin >> res;
  cout << "! " << res;
  return 0;
}
