#include<fstream>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
int v[16001],a[16001][16001],s,maxs,val[16001],n;
void dfs(int x)
{int i;
s=s+val[x];
if(maxs<s)maxs=s;
    v[x]=1;
 for(i=1;i<=n;i++)
        if(a[x][i]==1&&v[i]==0)
            {dfs(i);i=1;}
}
int main()
{
    int i,j;
    f>>n;
    for(i=1;i<=n;i++)f>>val[i];
    while(f>>i>>j)
    {
        a[i][j]=a[j][i]=1;
    }
    for(i=1;i<=n;i++)
        {s=0;
        dfs(i);}
    g<<maxs;
}