#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

pair<vector<int>, vector<int>> primes_lpf(const int n) {
  vector<int> primes; primes.reserve(n / 10);
  vector<int> lpf(n + 1);
  for (int i = 2; i <= n; i += 2) lpf[i] = 2;
  for (int i = 3; i <= n; i += 6) lpf[i] = 3;
  if (2 <= n) primes.push_back(2);
  if (3 <= n) primes.push_back(3);
  // 5 * x <= n, x <= floor(n / 5)
  const int n5 = n / 5;
  int x = 5;
  char add_next = 2;
  for (; x <= n5; x += add_next, add_next ^= 0x2 ^ 4) {
    int px = lpf[x];
    if (px == 0) {
      lpf[x] = px = x;
      primes.push_back(x);
    }
    for (int i = 2;; ++i) {
      int q = primes[i];
      int y = q * x;
      if (y > n) break;
      lpf[y] = q;
      if (q == px) break;
    }
  }
  for (; x <= n; x += add_next, add_next ^= 0x2 ^ 4) {
    if (lpf[x] == 0) {
      lpf[x] = x;
      primes.push_back(x);
    }
  }
  return {move(primes), move(lpf)};
}

constexpr int PSIZE = 1000000;
auto [primes, lpf] = primes_lpf(PSIZE);

vector<pair<int, int>>& factorize_lv(int x) {
  int ps[10], cs[10];
  int sz = 0;
  while (x != 1) {
    int p = lpf[x], c = 0;
    do {x /= p; c++;} while (x % p == 0);
    ps[sz] = p; cs[sz] = c; sz++;
  }
  static vector<pair<int, int>> fs;
  fs.clear();
  for (int i = 0; i < sz; i++) fs.emplace_back(ps[i], cs[i]);
  return fs;
}

struct LCA {
  int n;
  vector<int> idx;
  struct S { int v, depth; };
  vector<vector<S>> spt;
  static constexpr S min(S x, S y) { return x.depth < y.depth ? x : y; }
  LCA(const auto& g, int root) : n(g.size()), idx(n, -1) {
    assert(0 <= root && root < n);
    vector<S> tour;
    auto dfs = [&](auto&& self, int u, int d) -> void {
      idx[u] = tour.size();
      tour.emplace_back(u, d);
      for (int v : g[u]) if (idx[v] == -1) {
        self(self, v, d + 1);
        tour.emplace_back(u, d);
      }
    };
    dfs(dfs, root, 0);
    int m = tour.size();
    int w = bit_width(m + 0U);
    spt.resize(w);
    spt[0] = move(tour);
    for (int k = 0; k + 1 < w; k++) {
      int k2 = 1 << k;
      int sz = m - 2 * k2 + 1;
      spt[k+1].resize(sz);
      for (int i = 0; i < sz; i++) spt[k+1][i] = min(spt[k][i], spt[k][i+k2]);
    }
  }
  int lca(int u, int v) {
    int l = idx[u], r = idx[v];
    if (l > r) swap(l, r);
    int k = bit_width(r - l + 1U) - 1;
    return min(spt[k][l], spt[k][r+1-(1<<k)]).v;
  }
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  VVI to(n);
  rep(_, n - 1) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    to[u].emplace_back(v);
    to[v].emplace_back(u);
  }
  LCA lca(to, 0);
  static VI idx[1000010];
  vector<int> ord(n);
  rep(i, n) ord[i] = i;
  ranges::sort(ord, {}, [&](int v) { return lca.idx[v]; });
  for (int v : ord) {
    for (auto [p, e] : factorize_lv(a[v])) {
      idx[p].emplace_back(v);
    }
  }
  vector<mint> ans(n);
  rep(i, n) ans[i] = a[i];
  int psz = primes.size();
  vector<mint> invs(psz + 1);
  invs[0] = 1;
  rep(i, psz) invs[i+1] = invs[i] * primes[i];
  mint iprod = invs.back().inv();
  rrep(i, psz) invs[i] *= iprod, iprod *= primes[i];
  invs.pop_back();
  rep(i, psz) {
    int p = primes[i];
    mint ip = invs[i];
    VI id = move(idx[p]);
    while (!id.empty()) {
      int sz = id.size();
      rep(i, sz - 1) {
        ans[lca.lca(id[i], id[i+1])] *= ip;
      }
      int nsz = 0;
      rep(i, sz) {
        int v = id[i];
        a[v] /= p;
        if (a[v] % p == 0) id[nsz++] = v;
      }
      id.resize(nsz);
    }
  }
  for (int u : ord | views::reverse) for (int v : to[u]) if (lca.idx[v] < lca.idx[u]) ans[v] *= ans[u];
  for (mint x : ans) cout << x.val() << '\n';
}