#include <bits/stdc++.h>
#include "grader.h"
#define pii pair<int, int>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
vector<int> adj[600];
vector<int> ord;
void dfs(int i, int prt) {
ord.pb(i);
for (auto j : adj[i]) if (j != prt) dfs(j, i);
}
int findEgg(int N, vector<pii> bridges) {
for (int i = 1; i < N; ++i) {
int u = bridges[i].st;
int v = bridges[i].nd;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1, 0);
int l = 1, r = N;
while (l < r) {
int mid = ceil(1.0*(l+r)/2);
vector<int> check;
for (int i = 1; i <= mid; ++i) check.pb(ord[i]);
bool q = query(check);
if (q) r = mid;
else l = mid + 1;
}
return l;
}
