import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int m = Integer.parseInt(sa[1]);
		sa = br.readLine().split(" ");
		BigInteger[] a = new BigInteger[n];
		for (int i = 0; i < n; i++) {
			a[i] = new BigInteger(sa[i]);
		}
		List<List<Integer>> list = new ArrayList<>(n);
		for (int i = 0; i < n; i++) {
			list.add(new ArrayList<>());
		}
		for (int i = 0; i < m; i++) {
			sa = br.readLine().split(" ");
			int u = Integer.parseInt(sa[0]) - 1;
			int v = Integer.parseInt(sa[1]) - 1;
			list.get(u).add(v);
			list.get(v).add(u);
		}
		br.close();

		BigInteger[] dp = new BigInteger[n];
		boolean[] visit = new boolean[n];
		Queue<Integer> que = new ArrayDeque<>();
		que.add(0);
		dp[0] = a[0];
		visit[0] = true;
		while (!que.isEmpty()) {
			int cur = que.poll();
			for (int next : list.get(cur)) {
				BigInteger g1 = dp[cur].gcd(a[next]);
				BigInteger v1 = dp[cur].multiply(a[next]).divide(g1);
				if (visit[next]) {
					BigInteger g2 = v1.gcd(dp[next]);
					if (!g2.equals(dp[next])) {
						dp[next] = g2;
						que.add(next);
					}
				} else {
					visit[next] = true;
					dp[next] = v1;
					que.add(next);
				}
			}
		}

		BigInteger mod = BigInteger.valueOf(998244353);
		for (int i = 0; i < n; i++) {
			System.out.println(dp[i].mod(mod).intValue());
		}
	}
}