#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double


const int N = 5005 + 9, mod = 998244353;
const ll OO = 1e9;


bool isPrime(int n) {
    for(int i = 2; i * i <= n; i++) {
        if(n % i == 0) {
            return 0;
        }
    }
    return 1;
}

vector<int> v;
set<int> st;

void solve(int idx, int cur) {
    if(cur > 10000) return;
    if(idx == (int) v.size()) {
        if(cur > 1) {
            st.insert(cur);
        }
        return;
    }
    solve(idx + 1, cur);
    solve(idx + 1, cur * v[idx]);
}

vector<int> adj[N], adjTree[N], all;

int dp[5005][1500], val[5005];


int solve(int node, int par, int last) {
    auto &ret = dp[node][last];
    if(ret != -1) return ret;


    ret = 10000;
    for(auto i: adj[last]) {
        int t = 0;
        if(all[i] != val[node]) t = all[i];

        for(auto j: adjTree[node]) {
            if(j != par) {
                t += solve(j, node, i);
                if(t > ret) break;
            }
        }
        ret = min(ret, t);
    }
    return ret;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    for(int i = 2; i <= 100; i++) {
        st.insert(i);
        if(isPrime(i)) {
            v.push_back(i);
        }
    }

    // cout << (int) v.size() << '\n';
    solve(0, 1);
    for(auto i: st) all.push_back(i);

    // cout << (int) all.size() << '\n';



    int c = 0;
    for(int i = 0; i < (int) all.size(); i++) {
        adj[i].push_back(i);
        for(int j = i + 1; j < (int) all.size(); j++) {
            if(__gcd(all[i], all[j]) > 1) {
                c += 2;
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }


    for(int i = 0; i < (int) all.size(); i++) {
        adj[(int) all.size()].push_back(i);
    }

    int n;
    cin >> n;

    for(int i = 1; i <= n; i++) cin >> val[i];

    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adjTree[u].push_back(v);
        adjTree[v].push_back(u);
    }
    memset(dp, -1, sizeof dp);
    cout << solve(1, 0, (int) all.size());



    return 0;
}