#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;
vvll g;
vll ans, sz;
void dfs(ll node, ll par) {
for (auto it : g[node]) {
if (it!= par) {
dfs(it,node);
sz[node]+=sz[it];
ans[it] = max(sz[it], ans[it]);
}
}
if (par!=-1)ans[node] = max(ans[node], sz[par]);
}
int LocateCentre(int n, int pp[], int S[], int D[]) {
g.resize(n), ans.resize(n), sz.resize(n);
loop(i,0,n-1) {
g[S[i]].push_back(D[i]);
g[D[i]].push_back(S[i]);
}
loop(i,0,n) sz[i] = pp[i];
dfs(0,-1);
ll ansi, mini = inf;
loop(i,0,n) if (ans[i] < mini) {
mini = ans[i];
ansi = i;
}
return ansi;
}
