#include<iostream>
#include<algorithm>
#include<random>
#include<vector>
#include<chrono>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#include<cstring>
#define pii pair<int,int>
using namespace std;
int all[100005];
int n;
vector<int>v[100005];
vector<int>pr;
vector<pii>edge;
int mx=-1;
int ans=1;
bool is[1000005];
int num[1000005];
void init(){
    int now=mx;
    memset(is,0,sizeof(is));
    for(int i=2;i<=now;i++){
        if(is[i]==1)continue;
        bool yes=0;
        for(int j=i+i;j<=now;j+=i){
            if(num[j]){
                yes=1;
            }
            is[j]=1;
        }
        if(yes)pr.push_back(i);
    }
}
int f[100005];
int sz[100005];
int find(int x){
    if(x==f[x])return x;
    else return f[x]=find(f[x]);
}
void init1(){
    for(int i=1;i<=n;i++){
        f[i]=i;
        sz[i]=1;
    }
}
signed main(){
    cin>>n;
    int one=0;
    set<int>st;
    set<int>prr;
    memset(num,0,sizeof(num));
    for(int i=1;i<=n;i++){
        cin>>all[i];
        num[all[i]]=1;
        mx=max(mx,all[i]);
        st.insert(all[i]);
        if(all[i]==1)one++;
    }
    init();
    for(int i=0;i<n-1;i++){
        int x,y;
        cin>>x>>y;
        edge.push_back({x,y});
    }
    if(one==n){
        cout<<0<<endl;
        return 0;
    }
    for(auto i:pr){
        init1();
        //cerr<<i<<endl;
        for(auto [u,v]:edge){
            if(all[u]%i==0&&all[v]%i==0){
                int xx=find(u);
                int yy=find(v);
                f[xx]=yy;
                sz[yy]+=sz[xx];
                ans=max(sz[yy],ans);
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}