#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> a(100005);
vector<int> v[100005], pdiv[1000005];
int k, m;
vector<int> prime;
vector<bool> isprime(1e3+5, true);
vector<bool> vis(1e6+5, true);
int x, res, ans=0;
void dfs(int now){
    res++;
    vis[now]=true;
    for(auto i: v[now]){
        // cout<<"tetangga "<<now<<" : "<<i<<" dan "<<x<<"\n";
        if(vis[i]) continue;
        dfs(i);
    }
}
void sieve(){
    isprime[1]=false;
    prime.push_back(2);
    prime.push_back(3);
    for(int i=4; i<=1e3; i+=2) isprime[i]=false;
    for(int i=9; i<=1e3; i+=6) isprime[i]=false;
    for(ll i=5; i<=1e3; i+=2){
        if(isprime[i]){
            prime.push_back(i);
            for(ll j=i*i; j<=1e3; j+=i*2){
                isprime[j]=false;
            }
        }
    }
}
int main(){
    sieve();
    int n;
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>a[i];
    }
    for(int i=0; i<n-1; i++){
        cin>>k>>m;
        v[k].push_back(m);
        v[m].push_back(k);
    }
    for(int i=1; i<=n; i++){
        for(int j=0; j<prime.size(); j++){
            if(a[i]%prime[j] == 0){
                pdiv[prime[j]].push_back(i);
            }
            while(a[i]%prime[j] == 0) a[i]/=prime[j];
        }
        if(a[i] != 1){
            pdiv[a[i]].push_back(i);
        }
    }
    for(int i=2; i<1e6; i+=2){
        if(pdiv[i].size() == 0) continue;
        // cout<<"now "<<i<<"\n";
        for(int j=0; j<pdiv[i].size(); j++){
            // cout<<pdiv[i][j]<<" ";
            vis[pdiv[i][j]]=false;
        }
        // cout<<"\n";
        for(int j=0; j<pdiv[i].size(); j++){
            if(!vis[pdiv[i][j]]){
                res=0;
                dfs(pdiv[i][j]);
                ans=max(ans, res);
            }
        }
        for(int j=0; j<pdiv[i].size(); j++){
            vis[pdiv[i][j]]=true;
        }
        if(i == 2) i--;
    }
    cout<<ans<<"\n";
}