#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int sum=0, ans=INT_MAX/2, best;
vector<int> sz;
vector<vector<int> > graph;
void dfs(int node, int par){
int mx=0;
for (auto num:graph[node])if (num!=par)dfs(num, node), sz[node]+=sz[num], mx=max(mx, sz[num]);
if (max(mx, sum-sz[node])<ans)ans=max(mx, sum-sz[node]), best=node;
}
int LocateCentre(int n, int pp[], int s[], int d[]){
graph.clear();
sz.clear();
graph.resize(n);
sz.resize(n);
for (int i=0; i<n; ++i)sz[i]=pp[i], sum+=sz[i];
for (int i=0; i<n-1; ++i){
graph[s[i]].pb(d[i]);
graph[d[i]].pb(s[i]);
}
dfs(0, 0);
return best;
}
