/*

     Problem:P1352 没有上司的舞会

     OJ:        洛谷

     User:    S.B.S.

     Time:    27 ms

     Memory: 16992 kb

     Length: N/A

 */

 #include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<cstdlib>

 #include<iomanip>

 #include<cassert>

 #include<climits>

 #include<functional>

 #include<bitset>

 #include<vector>

 #include<list>

 #include<map>

 #define F(i,j,k) for(int i=j;i<=k;i++)

 #define M(a,b) memset(a,b,sizeof(a))

 #define FF(i,j,k) for(int i=j;i>=k;i--)

 #define maxn 10001

 #define inf 0x3f3f3f3f

 #define maxm 1001

 #define mod 998244353

 //#define LOCAL

 using namespace std;

 int read(){

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m;

 int x,y,k;

 int cnt,c[maxn],head[maxn];

 bool b[maxn];

 int f[maxn][];

 vector <int> edge[maxn];

 void dfs(int u)

 {

     int a,b;

     for(int i=;i<edge[u].size();i++)

     {

         dfs(edge[u][i]);

         f[u][]+=max(f[edge[u][i]][],f[edge[u][i]][]);

         f[u][]+=f[edge[u][i]][];

     }

     f[u][]+=c[u];

 }

 int main()

 {

     std::ios::sync_with_stdio(false);//cout<<setiosflags(ios::fixed)<<setprecision(1)<<y;

     #ifdef LOCAL

     freopen("data.in","r",stdin);

     freopen("data.out","w",stdout);

     #endif

     int n,m;

     cin>>n;

     for(int i=;i<=n;i++) cin>>c[i];

     int x,y;

     for(int i=;i<=n;i++)

     {

         cin>>x>>y;

         if(x==&&y==) break;

         else

         {

             edge[y].push_back(x);

             b[x]=true;

         }

     }

     for(int i=;i<=n;i++)

     {

         if(b[i]==false)

         {

             dfs(i);

             cout<<max(f[i][],f[i][])<<endl;

             break;

         }

     }

     return ;

 }