#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 = 1e5 + 5;
int vis[N];
vector<int> v[N];
int bfs(int x) {
    int cnt = 0;
    queue<int> q;
    q.push(x);
    while (!q.empty()) {
        cnt++;
        x = q.front();
        vis[x] = 1;
        q.pop();
        for (auto u : v[x]) {
            if (!vis[u])
                q.push(u);
        }
    }
    return cnt;
}
signed main() {
    int n, m, x, y;
    char c;
    string str[105];
    int mx = 0, ans = 0;
    map<char, int> mp;
    int a[N];

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n - 1; i++) {
        cin >> x >> y;
        if (__gcd(a[x], a[y]) > 1) {
            v[x].pb(y);
            v[y].pb(x);
        }
    }

    for (int i = 1; i < n; i++) {
        if (!vis[N] && a[i] > 1)
            mx = max(bfs(i), mx);
    }
    cout << mx;
}