#include "highway.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define pb push_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define vv vector
typedef pair<int, int> pii;
#define ll long long
const int NN = 90000;
vv<pii> edges[NN];
vv<int> tr;
vv<int> tt;
int un[NN], used[NN], wh[NN], rr, dd[NN], on[NN], l, r;
ll dis;
void dfs(int u, int p, int d = 0){
if(d == dis) tt.pb(u);
dd[u] = d;
for(auto x : edges[u]){
if(x.ff == p) continue;
on[x.ff] = x.ss;
dfs(x.ff, u, d+1);
}
}
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
for(int i=0;i<sz(V);i++){
edges[V[i]].pb({U[i], i});
edges[U[i]].pb({V[i], i});
}
int mm = sz(V);
tr.resize(mm, 0);
dis = ask(tr)/A;
queue<int> qq;
qq.push(0);
un[0] = 1, used[0] = 1;
int last = 1;
wh[last] = 0;
// finding one of s or t
while(!qq.empty()){
int cur = qq.front(); qq.pop();
for(auto x : edges[cur]){
if(used[x.ff]) continue;
un[x.ff] = ++last;
used[x.ff] = 1;
wh[last] = x.ff;
qq.push(x.ff);
}
}
//~ for(int i=0;i<N;i++) cout<<un[i]<<" ";
//~ cout<<"\n";
l = 1, r = last;
ll br = dis * B;
//~ cout<<un[0]<<" "<<un[66138]<<"\n";
while(l < r){
int m = (l + r -1)>>1;
//~ cout<<l<e<" "<<m<<" "<<r<<"\n";
for(int i=1;i<=m;i++){
for(auto x:edges[wh[i]]){
if(un[x.ff] > m) continue;
tr[x.ss] = 1;
}
}
ll res = ask(tr);
tr.assign(mm, 0);
//~ cout<<res<<" "<<br<<"\n";
if(res < br) l = m+1;
else r = m;
}
//~ int m = l;
//~ for(int i=1;i<=m;i++){
//~ for(auto x:edges[wh[i]]){
//~ if(un[x.ff] > m) continue;
//~ tr[x.ss] = 1;
//~ }
//~ }
//~ int res = ask(tr);
//~ tr.assign(mm, 0);
//~ if(res < br) l = r;
rr = wh[l];
dfs(rr, -1, 0);
l = 0, r = sz(tt)-1;
while(l < r){
int m = (l + r)>>1;
tr.assign(mm, 0);
for(int i=0;i<=m;i++) tr[on[tt[i]]] = 1;
ll res = ask(tr);
if(res > dis*A) r = m;
else l = m+1;
}
//~ cout<<rr<<" "<<tt[l]<<"\n";
answer(rr, tt[l]);
}
/*
7 6 1 2 0 4
0 1
0 2
0 3
3 4
2 6
3 5
*/
