#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;

template <class T> struct csr {
    using itr = typename std::vector<T>::iterator;
    struct Node {
        itr st, en;
        itr begin() { return st; }
        itr end() { return en; }
        int size() { return en - st; }
        T operator[](int p){ return st[p]; }
    };
    const int N;
    std::vector<int> start;
    std::vector<T> E;
    std::vector<std::pair<int,T>> edge;
    csr(int n) : N(n), start(n + 1) {}
    void add_edge(int u, T v){
        assert(0 <= u && u < N);
        start[u + 1]++;
        edge.emplace_back(u, v);
    }
    void build(){
        E.resize(edge.size());
        for(int i = 0; i < N; i++) start[i + 1] += start[i];
        auto cnt = start;
        for(auto [u, v] : edge) E[cnt[u]++] = v;
    }
    Node operator[](int p) {
        return Node{E.begin() + start[p], E.begin() + start[p + 1]};
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    constexpr int r = 1'000'000;
    vector<int> tb(r + 1);
    for(int i = 2; i <= r; i++){
        if(tb[i] != 0) continue;
        for(int j = i; j <= r; j += i){
            if(tb[j] == 0) tb[j] = i;
        }
    }

    vector<map<int,int>> mp(n);
    vector<mint> ans(n, 1);
    for(int i = 0, v; i < n; i++){
        cin >> v;
        ans[i] = mint::raw(v);
        while(v != 1){
            int div = tb[v], cnt = 0;
            do{
                cnt++;
                v /= div;
            }while(tb[v] == div);
            mp[i][div] = cnt;
        }
    }

    csr<int> g(n);
    for(int i = 1, u, v; i < n; i++){
        cin >> u >> v;
        u--, v--;
        g.add_edge(u, v);
        g.add_edge(v, u);
    }
    g.build();

    auto dfs = [&](auto dfs, int v, int p) -> void {
        for(auto u : g[v]){
            if(u == p) continue;
            dfs(dfs, u, v);
            if(mp[u].size() > mp[v].size()){
                swap(mp[u], mp[v]);
                ans[v] = ans[u];
            }
            for(auto [key, cnt] : mp[u]){
                auto it = mp[v].find(key);
                if(it == mp[v].end()){
                    mp[v][key] = cnt;
                    while(cnt >= 1){
                        ans[v] *= key;
                        cnt--;
                    }
                }else{
                    int d = cnt - it->second;
                    while(d >= 1){
                        d--;
                        ans[v] *= key;
                        it->second++;
                    }
                }
            }
        }
    };
    dfs(dfs, 0, -1);

    for(auto v : ans) cout << v.val() << '\n';
}