#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second 
#define deb(var) cerr << #var << '=' << (var) << "; "
#define int long long
int n, m, c[10010];
const int mod = 998244353;
vector<int> g[10010]; int ind[10010], ord[10010], f[10010]; 
int lcm(int x, int y) {
	if (!x || !y) return x + y;
	return x / __gcd(x, y) * y;
}
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> c[i];
	while (m--) {
		int u, v;
		cin >> u >> v; g[u].pb(v); ind[v]++;
	}
	queue<int> q;
	for (int i = 1; i <= n; i++) 
		if (!ind[i]) q.push(i);
	int cnt = 0;
	while (q.size()) {
		int u = q.front(); q.pop();
		ord[++cnt] = u;
		for (int j = 0; j < g[u].size(); j++) {
			int v = g[u][j];
			ind[v]--;
			if (!ind[v]) q.push(v); 
		}
	} 
	int ans = c[1];
	f[1] = ans;
	for (int j = 1; j <= n; j++) {
		int u = ord[j];
		for (int k = 0; k < g[u].size(); k++) {
			int v = g[u][k];
			f[v] += f[u] / c[u];
		}
		f[u] %= c[u];
	}
	for (int i = 2; i <= cnt; i++) {
		int u = ord[i];
		int o = c[u] / __gcd(f[u], c[u]);
		for (int j = 1; j <= n; j++) {
			int u = ord[j];
			f[u] *= o;
			for (int k = 0; k < g[u].size(); k++) {
				int v = g[u][k];
				f[v] += f[u] / c[u];
			}
			f[u] %= c[u];
		}
		ans = ans * o % mod;
	}
	cout << ans;
}