#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	vector<vector<int>>to(n);
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}
	set<int>pst;
	rep(i, n) {
		int x = a[i];
		for (int j = 2; j* j <= x; ++j) {
			if (0 != x % j)continue;
			pst.insert(j);
			while (!(x%j))x /= j;
		}
		if (1 != x)pst.insert(x);
	}
	vector<mint>ans(n, 1);
	for (auto p : pst) {
		vector<int>cnt(n), dp(n, INF);
		rep(i, n) {
			int ca = a[i];
			while (!(ca%p)) {
				cnt[i]++;
				ca /= p;
			}
		}
		std::priority_queue<P, vector<P>, std::greater<P>> pq;
		pq.push({ cnt[0],0 });
		dp[0] = cnt[0];
		while (!pq.empty()) {
			auto top = pq.top();
			pq.pop();
			int val = top.first;
			int pos = top.second;
			if (dp[pos] < val) continue;
			for (auto npos : to[pos]) {
				int nval = max(dp[pos], cnt[npos]);
				if (chmin(dp[npos], nval)) {
					pq.push({ dp[npos],npos });
				}
			}
		}
		vector<mint>pw(100);
		pw[0] = 1;
		rep2(i, 1, 100)pw[i] = pw[i - 1] * p;
		rep(i, n)ans[i] *= pw[dp[i]];
	}
	rep(i, n)cout << ans[i].val() << endl;
	return 0;
}