#include <bits/stdc++.h>
using namespace std;

const int N = 500000;
const long mod = 998244353;

bool seen[N];
vector<int> path[N];
map<long, int> mp[N];
long ans[N];

void dfs(int cur){
  seen[cur] = true;
  
  vector<int> child;
  for(auto next:path[cur]){
    if(!seen[next]) child.emplace_back(next);
  }
  for(auto next:child) dfs(next);
  
  for(auto i:child){
    for(auto x:mp[i]){
      int cnt = x.second - mp[cur][x.first];
      for(int j=0; j<cnt; j++){
        ans[cur] = ans[cur] * (x.first) % mod;
      }
      if(cnt>0) mp[cur][x.first] += cnt;
    }
  }
}

int main(){
  int n;
  cin >> n;
  
  vector<int> prime;
  for(int i=2; i<=1000; i++){
    bool is_prime = true;
    for(int p=2; p*p<=i; p++){
      if(i%p == 0){
        is_prime = false;
        break;
      }
    }
    if(is_prime) prime.emplace_back(i);
  }
  
  for(int i=0; i<n; i++){
    long a;
    cin >> a;
    ans[i] = a;
    for(auto p:prime){
      while(a%p==0){
        mp[i][p]++;
        a /= p;
      }
    }
    if(a>1) mp[i][a]++;
  }
  
  for(int i=0; i<n-1; i++){
    int u, v;
    cin >> u >> v;
    u--, v--;
    path[u].emplace_back(v);
    path[v].emplace_back(u);
  }
  
  dfs(0);
  for(int i=0; i<n; i++){
    cout << ans[i] << endl;
  }
}