//***只要你 目光是瞄准月亮 迷失过 又有何妨***//
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int n;
const int N=1e5;
ll fac[N];
int a[N];
int b[N];
int c[N];
int d[N];
void solve()
{
    cin>>n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        d[i]=a[i];
    }
    for (int i=1;i<=n;i++)
    {
        cin>>b[i]>>c[i];
        if (a[b[i]]+a[c[i]]<=d[i])
        {
            d[i]=a[b[i]]+a[c[i]];
        }

    }
    ll sum=0;
    for (int i=1;i<=n;i++)
    {
        sum+=d[i];
    }
    cout<<sum<<'\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    t=1;
    while (t--)
    {
        solve();
    }
    return 0;
}