#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;

vector<vector<int>> G;
vector<ll> A;
vector<ll> ans;
vector<int> prime_list;

// 素数判定: エラトステネスの篩
vector<bool> prime(int n) {
    vector<bool> is_prime(n + 1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i <= n; i++) {
        if (is_prime[i]) {
            for (int j = i * 2; j <= n; j += i) {
                is_prime[j] = false;
            }
        }
    }
    return is_prime;
}

// 素因数分解
unordered_map<int,int> factorization(ll n) {
    unordered_map<int,int> arr;
    ll temp = n;
    for (int p : prime_list) {
        if ((ll)p * p > temp) break;
        if (temp % p == 0) {
            int cnt = 0;
            while (temp % p == 0) {
                cnt++;
                temp /= p;
            }
            arr[p] = cnt;
        }
    }
    if (temp != 1) {
        arr[(int)temp] = 1;
    }
    if (arr.empty()) {
        arr[(int)n] = 1;
    }
    return arr;
}

// mod累乗
ll modpow(ll a, ll e, ll mod) {
    ll r = 1;
    while (e > 0) {
        if (e & 1) r = (r * a) % mod;
        a = (a * a) % mod;
        e >>= 1;
    }
    return r;
}

// DFS
unordered_map<int,int> dfs(int v, int p) {
    auto ret = factorization(A[v]);
    for (int nv : G[v]) {
        if (nv == p) continue;
        auto tmp = dfs(nv, v);
        if (ret.size() < tmp.size()) swap(ret, tmp);
        for (auto &kv : tmp) {
            int key = kv.first;
            int val = kv.second;
            if (ret[key] < val) {
                ret[key] = val;
            }
        }
    }
    for (auto &kv : ret) {
        int prime = kv.first;
        int e = kv.second;
        ans[v] = (ans[v] * modpow(prime, e, MOD)) % MOD;
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    A.resize(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    G.assign(N, {});
    for (int i = 0; i < N - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    // 素数リスト作成 (1e3まで)
    auto P = prime(1000);
    for (int i = 0; i < (int)P.size(); i++) {
        if (P[i]) prime_list.push_back(i);
    }

    ans.assign(N, 1);
    dfs(0, -1);

    for (int i = 0; i < N; i++) {
        cout << ans[i] << "\n";
    }
    return 0;
}