#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    vector<vector<int>> g(n);
    rep(i, n-1) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    const int M = 1e6 + 10;
    vector<int> v(M, -1);
    repu(i, 2, M) {
        if(v[i] != -1) continue;
        for(int j = i; j < M; j+=i) v[j] = i;
    }
    
    vector<unordered_map<int, int>> ps(n);
    rep(i, n) {
        int tmp = a[i];
        while(tmp > 1) {
            ps[i][v[tmp]]++;
            tmp /= v[tmp];
        }
    }

    vector<mint> ans(n);
    rep(i, n) ans[i] = a[i];
    auto dfs = [&](auto dfs, int pos, int pre) -> void {
        for(int to: g[pos]) if(to != pre) {
            dfs(dfs, to, pos);
            if(ps[to].size() > ps[pos].size()) {
                swap(ps[to], ps[pos]);
                ans[pos] = ans[to];
            }
            for(auto[x, y]: ps[to]) {
                if(ps[pos][x] < y) {
                    ans[pos] *= mint(x).pow(y-ps[pos][x]);
                    ps[pos][x] = y;
                }
            }
        }
    };
    dfs(dfs, 0, -1);
    rep(i, n) cout << ans[i].val() << '\n';
    return 0;
}