#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 5010;
int val[N];
vector<int> vec[N];
vector<int> p[110];
int f[N][110];
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
void dfs(int u, int fa) {
  int tmp[110];
  memset(tmp, 0, sizeof(tmp));
  for (int j = 0; j < vec[u].size(); j++) {
    int v = vec[u][j];
    if (v == fa) continue;
    dfs(v, u);
    for (int i = 2; i <= 100; i++) {
      tmp[i] += f[v][i];
    }
  }
  for (int i = 2; i <= 100; i++) {
    for (int j = 2; j <= 100; j++) {
      // 同时满足i j
      // 与j具有相同因子 and 与 %i == 0
      int cost = i * j / gcd(i, j);
      if (val[u] % cost == 0) cost = 0;
      f[u][i] = min(tmp[j] + cost, f[u][i]);
      if (gcd(i, j) > 1) {
        cost = i;
        if (val[u] % cost == 0) cost = 0;
        f[u][i] = min(tmp[j] + cost, f[u][i]);
      }
      for (int k = 0; k < p[j].size(); k++) {
          cost = i * p[j][k];
          if (val[u] % cost == 0) cost = 0;
          f[u][i] = min(tmp[j] + cost, f[u][i]);
      }
    }
  }
}

int main() {
  memset(f, 0x3f, sizeof(f));
  for (int i = 2; i <= 100; i++) {
    int flag = 1;
    int ti = i;
    for (int j = 2; j < i; j++) {
      if (ti % j == 0) {
        flag = 0;
        p[i].push_back(j);
        while(ti%j==0){
          ti/=j;
        }
        break;
      }
    }
  }
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &val[i]);
  }
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    vec[u].push_back(v);
    vec[v].push_back(u);
  }
  dfs(1, 0);
  int ans = 0x3f3f3f3f;
  for (int i = 2; i <= 100; i++) {
    ans = min(ans, f[1][i]);
  }
  printf("%d\n", ans);
  return 0;
}