#include<bits/stdc++.h>
#define For(i,n) for(int i=1;i<=n;++i)
#define maxn 5005
#define fi first
#define se second
#define inf 2000000000
#define lnf 2000000000000000000
#define _ push_back
#define ll long long
#define II pair<int,int>
#define III pair<II,int>
#define ve vector<int>
#define task 

using namespace std;

int d[maxn][105];
vector<int> adj[maxn];
int a[maxn];
int n;

void dfs(int u, int dad) {
	for(int v:adj[u]) if(v!=dad) {
		dfs(v,u);
	}	
	for(int i=2;i<=2*n;++i) {
		if(i!=a[u])
		d[u][i]+=i;
		for(int v:adj[u]) if(v!=dad) {
			int kq=d[v][i];
			for(int x=2;x<=2*n;++x) if(__gcd(x,i)>1) kq=min(kq,d[v][x]);
			d[u][i]+=kq;			
		}
	}
}

void inp(){
	cin >> n;
	For(i,n)
		cin >> a[i];
	for(int i=1;i<n;++i) {
		int u, v;
		cin >> u >> v;
		adj[u]._(v);
		adj[v]._(u);
	}
}

void outp(){
	dfs(1,0);
	int ds=d[1][2];
	int cmin=2; 
	for(int i=3;i<=2*n;++i) if(ds>d[1][i]) ds=d[1][i], cmin=i;
	cout << ds;
}

int main(){
	if(fopen(task".inp","r")) {
		freopen(task".inp","r",stdin);
		freopen(task".out","w",stdout);
	}
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	inp();
	outp();
}