#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")

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

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;

#define int ll

bool multipleTestCases = 0, sublime = 0;
const int N = 1e4 + 5, INF = 1e9 + 5, mod = 1e9 + 7, LOG = 22, SQ = 500;

int n, a[N], dp[N >> 1][N];
vector<int> g[N], primes[N], initPrimes;

void pre() {
    for (int i = 2; i < 100; i++) {
        if (!primes[i].size()) {
            initPrimes.push_back(i);

            for (int j = i; j < N; j += i) {
                primes[j].push_back(i);
            }
        }
    }
}

int solve(int node, int par, int val) {
    int &ret = dp[node][val];
    if (~ret) {
        return ret;
    }

    ret = val;

    if (val == a[node])
        ret = 0;

    // shof 3yalak

    for (auto &ch : g[node]) {
        if (ch == par) {
            continue;
        }

        int cur = INF;

        for (auto &p : primes[val])
            cur = min(cur, solve(ch, node, p));

        ret += cur;
    }

    // tawar mn zatak

    for (auto &p : initPrimes) {
        if (val * p >= N) {
            continue;
        }

        ret = min(ret, solve(node, par, val * p));
    }

    return ret;
}

void doWork() {
    cin >> n;

    pre();

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;

        g[u].push_back(v);
        g[v].push_back(u);
    }

    memset(dp, -1, sizeof dp);

    int ans = 2 * n;

    for (auto &i : initPrimes)
        ans = min(ans, solve(1, 1, i));

    cout << ans << el;
}

signed main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifndef ONLINE_JUDGE
    if (sublime) {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
#endif
    int tests = 1;
    if (multipleTestCases) {
        cin >> tests;
    }
    for (int tc = 1; tc <= tests; tc++) {
        doWork();
    }
}