#include <bits/stdc++.h>
#include "highway.h"
using namespace std;
const int MAXN = 90000;
int n, m, tIn[MAXN], timer;
vector<int> u, v, adj[MAXN], adjTree[MAXN];
bool visited[MAXN];
void Dfs(int u, int p) {
tIn[u] = timer++;
for(int v : adjTree[u])
if (v != p)
Dfs(v, u);
}
void BuildTree(int s) {
for(int i = 0; i < n; i++){
adjTree[i].clear();
visited[i] = 0;
}
queue<int> qu;
visited[s] = 1;
qu.push(s);
while (!qu.empty()) {
int u = qu.front();
qu.pop();
for(int v : adj[u])
if (!visited[v]) {
visited[v] = 1;
qu.push(v);
adjTree[u].push_back(v);
adjTree[v].push_back(u);
}
}
timer = 0;
Dfs(s, -1);
}
long long MyAsk(int l, int r) {
vector<int> w(m);
for(int i = 0; i < m; i++)
if ((l <= tIn[u[i]] && tIn[u[i]] <= r) || (l <= tIn[v[i]] && tIn[v[i]] <= r))
w[i] = 1;
else
w[i] = 0;
return ask(w);
}
int Find_city() {
assert(timer == n);
long long allA = MyAsk(-1, -1);
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r) >> 1;
if (MyAsk(mid + 1, r) != allA)
l = mid + 1;
else
r = mid;
}
for(int i = 0; i < n; i++)
if (tIn[i] == l)
return i;
assert(0);
}
void find_pair(int _n, vector<int> _u, vector<int> _v, int a, int b) {
n = _n;
u = _u;
v = _v;
m = u.size();
for(int i = 0; i < m; i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
long long allA = MyAsk(-1, -1);
iota(tIn, tIn + n, 0);
int l = 0, r = n - 1, root = -1;
while (l <= r){
int mid = (l + r) >> 1;
if (MyAsk(mid, n - 1) != allA){
root = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
BuildTree(root);
int s = Find_city();
BuildTree(s);
int t = Find_city();
answer(s, t);
}
