#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

const int N = 5e3 + 5, M = 1e4 + 5;

vector<int> G[N];
int dp[N][M], curVal[N];
int p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};

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

    ret = (val == curVal[node] ? 0 : val);
    for(auto &ch: G[node])
    {
        if(ch == par)
            continue;

        int mn = INT_MAX;
        for(int i = 0; i < 25; i++)
        {
            if(val % p[i])
                continue;
            mn = min(mn, solve(ch, node, p[i]));
        }
        ret += mn;
    }

    for(int i = 0; i < 25; i++)
        ret = min(ret, solve(node, par, val * p[i]));
    return ret;
}

void doWork()
{
    int n;
    cin >> n;
    memset(dp, -1, sizeof dp);
    for(int i = 1; i <= n; i++)
        cin >> curVal[i];

    for(int i = 0, u, v; i < n - 1; i++)
        cin >> u >> v, G[u].push_back(v), G[v].push_back(u);

    int ans = 2 * n;
    cout << min(ans, solve(1, -1, 2));
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}