#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #define inf 0x7fffffff

 using namespace std;

 const int maxn=;

 int n;

 int f[maxn][],vis[maxn];

 int father[maxn];

 void dfs(int root)

 {

     vis[root]=;

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

     {

         if (!vis[i] && father[i]==root)

         {

             dfs(i);

             f[root][] += max(f[i][],f[i][]);

             f[root][] += f[i][];

         }

     }

 }

 int main()

 {

     while (cin>>n)

     {

         memset(f,,sizeof(f));

         memset(vis,,sizeof(vis));

         for (int i= ;i<=n ;i++) father[i]=i;

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

         int a,b;

         int root;

         while (cin>>a>>b)

         {

             if (!a && !b) break;

             father[a]=b;

         }

         for (int i= ;i<=n ;i++) if (father[i]==i) root=i;

         dfs(root);

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

     }

     return ;

 }