using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var map = NMap(n - 1);
        var ans = LCM(n, a, map);
        WriteLine(string.Join("\n", ans));
    }
    static long[] LCM(int n, int[] a, int[][] map)
    {
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var dep = Enumerable.Repeat(-1, n).ToArray();
        dep[0] = 0;
        var q = new Queue<int>();
        q.Enqueue(0);
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            foreach (var next in tree[cur])
            {
                if (dep[next] >= 0) continue;
                dep[next] = dep[cur] + 1;
                q.Enqueue(next);
            }
        }
        var sorted = new List<(int id, int dep)>(n);
        for (var i = 0; i < n; ++i) sorted.Add((i, dep[i]));
        sorted.Sort((l, r) => r.dep.CompareTo(l.dep));
        var minlist = GetMinPDivList(1_000_000);
        var dlist = new Dictionary<int, int>[n];
        var ans = new long[n];
        for (var i = 0; i < n; ++i)
        {
            dlist[i] = PDiv(a[i], minlist);
            ans[i] = a[i];
        }
        foreach (var si in sorted)
        {
            foreach (var prev in tree[si.id])
            {
                if (dep[prev] < si.dep)
                {
                    if (dlist[prev].Count > dlist[si.id].Count)
                    {
                        foreach (var kv in dlist[si.id])
                        {
                            if (dlist[prev].ContainsKey(kv.Key))
                            {
                                if (dlist[prev][kv.Key] < kv.Value)
                                {
                                    ans[prev] = ans[prev] * Exp(kv.Key, kv.Value - dlist[prev][kv.Key]) % mod;
                                    dlist[prev][kv.Key] = kv.Value;
                                }
                            }
                            else
                            {
                                ans[prev] = ans[prev] * Exp(kv.Key, kv.Value) % mod;
                                dlist[prev][kv.Key] = kv.Value;
                            }
                        }
                    }
                    else
                    {
                        var lcm = ans[si.id];
                        var d = dlist[si.id];
                        foreach (var kv in dlist[prev])
                        {
                            if (d.ContainsKey(kv.Key))
                            {
                                if (d[kv.Key] < kv.Value)
                                {
                                    lcm = lcm * Exp(kv.Key, kv.Value - d[kv.Key]) % mod;
                                    d[kv.Key] = kv.Value;
                                }
                            }
                            else
                            {
                                lcm = lcm * Exp(kv.Key, kv.Value) % mod;
                                d[kv.Key] = kv.Value;
                            }
                        }
                        ans[prev] = lcm;
                        dlist[prev] = d;
                    }
                }
            }
        }
        return ans;
    }
    static int mod = 998_244_353;
    static int[] GetMinPDivList(int max)
    {
        var minPDivList = new int[max + 1];
        for (var i = 0; i <= max; ++i) minPDivList[i] = i;

        for (var i = 2; i * i <= max; ++i) if (minPDivList[i] == i)
            {
                for (var j = i * i; j <= max; j += i) if (minPDivList[j] == j)
                    {
                        minPDivList[j] = i;
                    }
            }
        return minPDivList;
    }
    static Dictionary<int, int> PDiv(int n, int[] minPDivList)
    {
        var p = minPDivList[n];
        if (n == p)
        {
            var dic = new Dictionary<int, int>();
            dic.Add(p, 1);
            return dic;
        }
        else
        {
            var dic = PDiv(n / p, minPDivList);
            if (dic.ContainsKey(p)) ++dic[p];
            else dic.Add(p, 1);
            return dic;
        }
    }
    static long Exp(long n, long p)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}