#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define PB push_back
#define pii pair<int, int>
using namespace std;
const int N = 2e6 + 5;
const int INF = 1e18;
vector<int> prime;
bool isprime[N];
void init(){
    for(int i=2; i<=1e6; i++) isprime[i] = 1;
    for(int i=2; i<=1e6; i++){
        if(!isprime[i]) continue;
        prime.PB(i);
        for(int j=i*i; j<=1e6; j+=i){
            isprime[j] = 0;
        }
    }
}
int a[N], vis[N];
map<int, vector<int>> edge[N];
set<int> st;

int dfs(int x, int f, int pr){
    vis[x] = 1;
    for(auto i : edge[x][pr]){
        if(i == f || vis[i]) continue;
        vis[x] += dfs(i, x, pr);
    }
    return vis[x];
}
void solve(){
    init();
    int n, ans = 0;
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        if(a[i] > 1) ans = 1;
    }
    for(int i=0; i<n-1; i++){
        int aa, bb;
        cin >> aa >> bb;
        int g = gcd(a[aa], a[bb]);
        int x = g;
        for(int j=2; j*j<=g; j++){
            if(x % j == 0){
                st.insert(j);
                edge[aa][j].PB(bb);
                edge[bb][j].PB(aa);
                while(x % j == 0)
                    x /= j;
            }
        }
        if(x > 1){
            st.insert(x);
            edge[aa][x].PB(bb);
            edge[bb][x].PB(aa);
        }
    }

    for(auto pr : st){
        for(int i=1; i<=n; i++){
            if(a[i] % pr) continue;
            if(vis[i]) continue;
            ans = max(ans, dfs(i, i, pr));
        }
        for(int i=1; i<=n; i++)
            vis[i] = 0;
    }
    cout << ans << endl;
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int T = 1;
    // cin >> T;
    while(T--){
        solve();
    }
}