#include<iostream>
#include<algorithm>
#include<random>
#include<vector>
#include<chrono>
#include<cmath>
#include<queue>
#include<set>
#include<map>
#define pii pair<int,int>
#define int long long
using namespace std;
int all[100005];
int n;
vector<int>v[100005];
vector<int>pr;
vector<pii>edge;
int mx=-1;
int ans=1;
void init(){
    int now=mx;
    for(int i=2;i<=sqrt(now);i++){
        if(now%i==0)pr.push_back(i);
        while(now%i==0){
            now/=i;
        }
    }
    if(now!=1)pr.push_back(now);
}
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;
    for(int i=1;i<=n;i++){
        cin>>all[i];
        mx=max(mx,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();
        for(auto [u,v]:edge){
            if(all[u]%i==0&&all[v]%i==0){
                //cout<<i<<" "<<u<<" "<<v<<endl;
                int xx=find(u);
                int yy=find(v);
                //cout<<xx<<" "<<yy<<endl;
                f[xx]=yy;
                sz[yy]+=sz[xx];
                ans=max(sz[yy],ans);
            }
        }
        //cout<<f[2]<<endl;
    }
    cout<<ans<<endl;




    return 0;
}