#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> dp[200005];
vector<int> g[200005];
vector<int> prime[200005];
int val[200005];
int ma;
void dfs(int u, int p) {
  for (auto &x : g[u]) {
    if (x != p) dfs(x, u);
  }
  for (auto &x : prime[val[u]]) {
    dp[u][x] = 1;
    int ma1 = 0, ma2 = 0;
    for (auto &y : g[u]) {
      if (y != p) {
        if (dp[y][x] > ma1)
          ma2 = ma1, ma1 = dp[y][x];
        else if (dp[y][x] > ma2)
          ma2 = dp[y][x];
      }
    }
    ma = max(ma, ma1 + ma2 + dp[u][x]);
    dp[u][x] += ma1;
  }
}
int main() {
  int n, u, v;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &val[i]);
  for (int i = 1; i <= n - 1; i++)
    scanf("%d %d", &u, &v), g[u].push_back(v), g[v].push_back(u);
  for (int i = 2; i <= 200000; i++) {
    if (prime[i].size() == 0) {
      for (int j = i; j <= 200000; j += i) prime[j].emplace_back(i);
    }
  }
  dfs(1, 0);
  printf("%d\n", ma);
  return 0;
}
