#include <bits/stdc++.h>
#define int long long
using namespace std;
int n;
int a[200010];
vector<int> v[200010];
int x[200010],y[200010];
bool vis[200010];
int mi = 1e9;
int ans;
void dfs(int d){
	vis[d] = true;
	mi = min(mi,a[d]);
	for (auto i : v[d]){
		if(!vis[i]) dfs(i); 
	}
	return;
}
void check(){
	for (int i=1;i<=n;i++) vis[i] = false;
	for (int i=1;i<=n;i++){
		if(!vis[i]){
			mi = 1e9;
			dfs(i);
			ans += mi;
		}
	}
	return;
}
void che(int d){
	if(d==n){
		check();
		return;
	}
	che(d+1);
	vector<int> g1 = v[x[d]];
	vector<int> g2 = v[y[d]];
	v[x[d]].push_back(y[d]);
	v[y[d]].push_back(x[d]);
	che(d+1);
	v[x[d]] = g1;
	v[y[d]] = g2;
	return;
}

signed main()
{
	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	for (int i=1;i<=n-1;i++){
		cin >> x[i] >> y[i];
	}
	che(1);
	cout << ans <<"\n";
	return 0;
}