#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
int n,m,i,j,v[16005],s,t,nr;
vector < int > V[16005];
int w[16005],viz[16005],nr1,nr2;
void citire()
{
    int x,y;
    for (i=1;i<=n;i++)
    {
        scanf("%d %d",&x,&y);
        V[x].push_back(y);
        V[y].push_back(x);
    }
}
int gc(int x)
{
    int j;
    for (j=0;j<V[x].size();j++) if ((!w[V[x][j]])&&(!viz[V[x][j]])) return 0;
    return 1;
}
void solve(int x)
{
    int i,j;
    for (j=0;j<V[x].size();j++)
     if ((!w[V[x][j]])&&(gc(V[x][j]))&&(!viz[V[x][j]])||(nr2==n-2))
    {
        t=t-v[V[x][j]];
        nr2++;
        w[V[x][j]]=1;
    }
}
int main()
{
    freopen("asmax.in","r",stdin);
    freopen("asmax.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++) scanf("%d",&v[i]),s=s+v[i];
    citire(); nr1=0;
    for (i=1;i<=n;i++) if (!viz[i])
    {
        nr2=nr1;
        t=s-v[i]; nr2++;
        memset(w,0,sizeof(w));
        w[i]=1;
        solve(i);
        if ((t>s)&&(nr2!=n)) {s=t; nr1=nr2; for (j=1;j<=n;j++) viz[j]=max(viz[j],w[j]);}
    }
    printf("%d",s);
    return 0;
}