#include <bits/stdc++.h>
#define oo -2e9
using namespace std;

ifstream fin("asmax.in");
ofstream fout("asmax.out");

int n , viz[16005] , val[16005] , a[16005][16005] , sum , mx , i;
vector<int> L[1605];

void Init()
{
    for(int k = 1;k <= n;k++)
        viz[k] = 0;
}

void DFS(int nod , int ant)
{
    viz[nod] = 1;
    if(nod != i) a[i][nod] = val[nod] + a[i][ant];
    for(int w : L[nod])
        if(!viz[w] and w < nod) DFS(w , nod);
}

int main()
{
    int j;
    fin >> n;
    for(i = 1;i <= n;i++)
        fin >> val[i];
    for(i = 1;i <= n;i++)
        for(j = 1;j <= n;j++)
            a[i][j] = oo;
    while(fin >> i >> j)
    {
        L[i].push_back(j);
        L[j].push_back(i);
    }
    for(i = 1;i <= n;i++)
        a[i][i] = val[i];
    for(i = 2;i <= n;i++)
    {
        Init();
        DFS(i , i);
    }
    /**for(i = 1;i <= n;i++ , fout << "\n")
        for(j = 1;j <= n;j++)
            fout << a[i][j] << " ";*/
    for(i = 1;i <= n;i++)
        if(a[i][1] >= 0) sum += a[i][1] - val[1];
    sum += val[1];
    fout << sum;
    return 0;
}
/**
1 2 3 4 5  6 7 8 9
1 4 2 1 -1 3 3 2 3
*/