#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ssuyu                                                                  \
    ios_base::sync_with_stdio(0);                                              \
    cin.tie(0)
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define int long long
#define PI acos(-1)
#define all(x) (x).begin(), (x).end()
const int N = 1e6 + 5;
int a[N];
int prime[N] = {0}, f[N] = {0};
vector<int> primes;
int Find(int a) {
    if (f[a] <= 0) {
        return a;
    } else
        return f[a] = Find(f[a]);
}
int Union(int a, int b) {
    int fa = Find(a);
    int fb = Find(b);
    if (fa == fb)
        return -f[fa];
    if (f[fa] > f[fb])
        swap(fa, fb);
    f[fa] += f[fb];
    f[fb] = fa;
    return -f[fa];
}
void getprimes(int n) {
    for (int i = 2; i <= n; i++) {
        if (!prime[i]) {
            primes.pb(i);
        }
        for (auto u : primes) {
            if (u * i > n)
                break;
            prime[u * i] = 1;
            if (!(i % u))
                break;
        }
    }
}
struct edge {
    int u;
    int v;
    int w = 1;
} edge[N];
signed main() {
    int n, m, x, y;
    int mx = 0, ans = 0;
    vector<int> affect;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        mx = max(mx, a[i]);
    }
    getprimes(mx);
    for (int i = 0; i < n - 1; i++) {
        cin >> x >> y;
        edge[i].v = x;
        edge[i].u = y;
        f[edge[i].v] = -1;
        f[edge[i].u] = -1;
        edge[i].w = __gcd(a[x], a[y]);
    }
    for (auto p : primes) {
        for (int i = 0; i < n - 1; i++) {
            if (!(edge[i].w % p)) {
                edge[i].w /= p;
                ans = max(Union(edge[i].u, edge[i].v), ans);
                affect.pb(edge[i].u);
                affect.pb(edge[i].v);
            }
        }
        for (auto u : affect)
            f[u] = -1;

        affect.clear();
    }
    cout << ans;
}