#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#include "traffic.h"
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int tot,a[1000005],p[1000005],sub[1000005];
vector<int>g[1000005];
void dfs(int node,int par){
for(auto it : g[node]){
if(it==par){
continue;
}
dfs(it,node);
sub[node]+=sub[it];
p[node]=max(p[node],sub[it]);
}
p[node]=max(p[node],tot-sub[node]-a[node]);
sub[node]+=a[node];
}
int LocateCentre(int N,int pp[],int S[],int D[])
{
int n=N;
memset(sub,0,sizeof(sub));
memset(p,0,sizeof(p));
tot=0;
for(int i=0;i<n;i++)
{
a[i]=pp[i];
tot+=a[i];
}
for(int i=0;i<n-1;i++)
{
g[S[i]].pb(D[i]);
g[D[i]].pb(S[i]);
}
dfs(0,-1);
ll mn=LINF,pos=0;
for(int i=0;i<n;i++)
{
if(mn>p[i]){
mn=p[i];
pos=i;
}
}
return pos;
}
/*
int32_t main(){
CODE_START;
*/
