#include <bits/stdc++.h>

using namespace std;

const int inf = 1e5;

const int Nmax = 5005;

int n, lim;

vector<int> v[Nmax];
int dp[Nmax][2*Nmax];

vector<int> primes;
vector<int> factors[Nmax];

int curr_val[2*Nmax], val[Nmax];
int factor[2*Nmax];

bool good[2*Nmax];


void dfs(int node, int dad = -1)
{
    for(auto it : v[node])
        if(dad != it)
            dfs(it, node);

    for(auto p : primes) factor[p] = inf;

    int i;

    for(i=2; i<=lim; ++i)
    if(good[i] || i == val[node])
    {
        curr_val[i] = 0;

        for(auto it : v[node])
            if(dad != it)
                curr_val[i] += dp[it][i];

        if(i != val[node]) curr_val[i] += i;

        for(auto p : factors[i])
            factor[p] = min(factor[p], curr_val[i]);
    }

    for(i=1; i<=lim; ++i)
    if(good[i])
    {
        dp[node][i] = inf;
        for(auto p : factors[i])
            dp[node][i] = min(dp[node][i], factor[p]);
    }
}

void precompute(int lim)
{
    int i;
    for(i=2; i<=lim; ++i)
    {
        int x = i;
        good[i] = 1;

        for(auto it : primes)
        {
            int cnt = 0;
            while(x % it == 0)
            {
                x /= it;
                ++cnt;
            }

            if(cnt >= 2) good[i] = 0;
            if(cnt >= 1) factors[i].push_back(it);
        }

        if(factors[i].size() && factors[i].back() > 100) good[i] = 0;

        if(factors[i].empty())
        {
            primes.push_back(i);
            factors[i].push_back(i);
        }
    }

    good[1] = 0;
}

int main()
{
  //  freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

    cin >> n;
    lim = 2*n;

    int i;

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

    precompute(lim);

    //for(auto it : primes) cout << it << ' '; cout << "#\n";
    //for(auto it : factors[30]) cout << it << ' '; cout << "@\n";


    for(i=1; i<n; ++i)
    {
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }

    dfs(1);

    int ans = inf;

    for(i=1; i<=lim; ++i)
        if(good[i])
            ans = min(ans, dp[1][i]);

    cout << ans << '\n';
    return 0;
}