#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 using namespace std;

 #define MAXN 6060

 int dp[MAXN][];

 int n,ans;

 vector<vector<int> >G;

 void dfs(int u,int father)

 {

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

         int v=G[u][i];

         if(v==father)continue;

         dfs(v,u);

         dp[u][]+=max(dp[v][],dp[v][]);

         dp[u][]+=dp[v][];

     }

 }

 int main()

 {

     int u,v;

     while(~scanf("%d",&n)){

         G.clear();

         G.resize(n+);

         memset(dp,,sizeof(dp));

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

             scanf("%d",&dp[i][]);

         }

         while(~scanf("%d%d",&u,&v)){

             if(u==&&v==)break;

             G[u].push_back(v);

             G[v].push_back(u);

         }

         dfs(,-);

         printf("%d\n",max(dp[][],dp[][]));

     }

     return ;

 }