#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
typedef int 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;
vll p;
ll dfs(ll node, ll par) {
// cout<<node<<" ";
for (auto it : g[node]) {
if (it!=par) {
ll c = dfs(it,node);
ans[node] = max(ans[node],c);
sz[node]+=c;
}
}
for (auto it : g[node]) {
if (it!=par) {
ans[it] = max(ans[it], sz[node]+p[node]);
}
}
return sz[node]+p[node];
}
int LocateCentre(int n, int pp[], int S[], int D[]) {
g.resize(n), ans.resize(n), sz.resize(n,0);
p.resize(n);
loop(i,0,n) p[i] = pp[i];
loop(i,0,n-1) {
g[S[i]].push_back(D[i]);
g[D[i]].push_back(S[i]);
}
dfs(0,-1);
ll ansi, mini = inf;
loop(i,0,n) if (ans[i] < mini) {
mini = ans[i];
ansi = i;
}
return ansi;
}
/*
5
10 10 10 20 20
0 2
2 1
2 3
3 4
*/
