#include <bits/stdc++.h>
#if !defined(LOL)
#include "friend.h"
#endif
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int maxn = (int)2e5+10;
vector<int> adj[maxn];
int used[maxn];
void add_edge(int a, int b){
adj[a].pb(b); adj[b].pb(a);
}
void add_friends(int a, int b){
for(auto u : adj[a]) add_edge(u,b);
}
bool chk(int s){
for(auto u : adj[s])
if(used[u]) return false;
return true;
}
int findSample(int n, int c[], int h[], int pro[])
{
int ans = 0;
for(int i = 1; i < n; i++){
if(pro[i]!=1) add_edge(h[i],i);
if(pro[i]) add_friends(h[i],i);
}
int dis[n+1];
for(int i = 0; i < n; i++){
int sum = 0;
fill(used, used+n,0);
fill(dis, dis+n,1500);
queue<int> Q; Q.push(i); dis[i]=0; used[i]=1;
while(!Q.empty()){
int s = Q.front(); Q.pop();
if(dis[s]%2) sum+=c[s];
for(auto u : adj[s]){
if(used[u]) continue;
used[u]=1; Q.push(u); dis[u]=dis[s]+1;
}
}
ans = max({ans, sum, accumulate(c,c+n,0)-sum});
}
return ans;
}
#if defined(LOL)
int main(void)
{
#define __MAXSIZE__ 100002
int confidence[__MAXSIZE__];
int host[__MAXSIZE__];
int protocol[__MAXSIZE__];
int n,i;
// Number of people
assert(scanf("%d",&n)==1);
// Confidence
for(i=0;i<n;i++)
assert(scanf("%d",&confidence[i])==1);
// Host and Protocol
for(i=1;i<n;i++)
assert(scanf("%d %d",&host[i],&protocol[i])==2);
// Answer
printf("%d\n",findSample(n,confidence,host,protocol));
return 0;
}
#endif
