#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
const int N = 500005;
const int INF = 0x3f3f3f3f;
ll a[N];
map<ll, ll> mp[N], m1, m2;
ll powmod(ll x, ll y, ll mod) {
    ll res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
void get_factor(ll n, map<ll, ll> &mp) {
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            while (n % i == 0) {
                n /= i;
                mp[i]++;
            }
        }
    }
    if (n != 1) mp[n]++;
}
vector<int> G[N];
int fa[N];
void dfs(int u) {
    for (auto v : G[u]) {
        if (v == fa[u]) continue;
        fa[v] = u;
        dfs(v);
        m1 = mp[u], m2 = mp[v];
        if ((int)m1.size() > (int)m2.size()) swap(m1, m2);
        for (auto [x, y] : m2) m1[x] = max(m1[x], y);
        mp[u] = m1;
    }
}
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    for (int i = 1; i <= n; i++) get_factor(a[i], mp[i]);
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1);
    for (int i = 1; i <= n; i++) {
        ll res = 1;
        for (auto [x, y] : mp[i]) res = res * powmod(x, 1ll * y, mod) % mod;
        printf("%lld\n", res);
    }
    return 0;
}