#include <cstdio>
#include <cstring>
#include <algorithm>

typedef long long ll;
const int mod = 998244353;
inline void mns(int &x, const int y) {if ((x -= y) < 0) x += mod;}
int pow3[17], dp[14348911], to3[1 << 15 | 1], coef[1 << 15 | 1], popcnt[1 << 15 | 1], n, m;
ll a[15], C;
bool mp[15][15], OK[1 << 15 | 1];
int Mn[1 << 15 | 1];
inline int dig(int S, int i) {S %= pow3[i + 1]; return S / pow3[i];}
int solve(int S) {//S中的数异或和为C
	int ans = 0; ll sumxor = 0;
	for (int i = 0; i < n; ++ i) if (S & 1ll << i) sumxor ^= a[i];
	ans += sumxor == C;
	for (int i = 60; i >= 0; -- i) {//第i位出现不同 
		sumxor = 0;
		for (int j = 0; j < n; ++ j) if (S & 1 << j) sumxor ^= a[j] - (a[j] & (1ll << i + 1) - 1);
		if (sumxor != C - (C & (1ll << i + 1) - 1)) break;
		int f[2][2];
		f[0][0] = 1, f[0][1] = f[1][0] = f[1][1] = 0;
		for (int j = 0; j < n; ++ j) if (S & 1 << j) {
			int t1 = ((a[j] & (1ll << i) - 1) + 1) % mod, t2 = (a[j] & 1ll << i ? (1ll << i) % mod : 0);
			int g[2][2]; g[0][0] = g[0][1] = g[1][0] = g[1][1] = 0;
			for (int x = 0; x <= 1; ++ x) {
				g[0][x] = 1ll * f[0][x ^ (a[j] >> i & 1)] * t1 % mod;
				g[1][x] = (1ll * f[1][x ^ (a[j] >> i & 1)] * t1 +
				1ll * f[0][x] * (a[j] >> i & 1) + 1ll * f[1][x] * t2) % mod;
			}
			memcpy(f, g, sizeof f);
		}
		ans = (ans + f[1][C >> i & 1]) % mod;
	}
	return ans;
}

int main() {
	scanf("%d%d%lld", &n, &m, &C);
	pow3[0] = 1;
	for (int i = 1; i <= n; ++ i) pow3[i] = 3 * pow3[i - 1];
	for (int i = 0; i < n; ++ i) scanf("%lld", a + i);
	for (int i = 1, u, v; i <= m; ++ i) scanf("%d%d", &u, &v), -- u, -- v, mp[u][v] = mp[v][u] = true;
	OK[0] = true;
	for (int S = 1; S < 1 << n; ++ S) {
		int low = 0;
		for (int i = 0; i < n; ++ i) if (S & 1 << i) {low = i; break;}
		OK[S] = OK[S & S - 1];
		for (int i = 0; i < n; ++ i) if ((S & 1 << i) && mp[i][low]) {OK[S] = false; break;}
		int mn = -1;
		for (int i = 0; i < n; ++ i) if (S & 1 << i) {
			to3[S] += pow3[i], ++ popcnt[S];
			if (mn == -1 || a[mn] > a[i]) mn = i;
		}
		Mn[S] = mn;
		if (popcnt[S] & 1) to3[S] += pow3[mn];
	}
	for (int S = 1; S < 1 << n; ++ S) {
		coef[S] = OK[S];
		int lowbit = S & -S;
		for (int S0 = S - 1 & S; S0; S0 = S0 - 1 & S)
			if (OK[S ^ S0] && (S0 & lowbit) == lowbit) mns(coef[S], coef[S0]);
	}
	dp[0] = 1;
	for (int S = 0; S < pow3[n]; ++ S) if (dp[S]) {
		int S0 = 0, fst = -1;
		for (int i = 0; i < n; ++ i) if (dig(S, i) == 0)
			if (fst == -1) fst = i; else S0 |= 1 << i;
		if (fst == -1) continue;
		for (int _ = S0; ; _ = _ - 1 & S0) {
			int S1 = _ | 1 << fst;
			if (coef[S1]) {
				int nxt = S + to3[S1];
				if (popcnt[S1] & 1) dp[nxt] = (dp[nxt] + 1ll * dp[S] * coef[S1]) % mod;
				else dp[nxt] = (dp[nxt] + 1ll * dp[S] * coef[S1] % mod * (a[Mn[S1]] + 1)) % mod;
			}
			if (!_) break;
		}
	}
	int base = 0, ans = 0;
	for (int i = 0; i < n; ++ i) base += pow3[i];
	for (int S = 1; S < 1 << n; ++ S) {
		int S0 = base;
		for (int i = 0; i < n; ++ i) if (S & 1 << i) S0 += pow3[i];
		ans = (ans + 1ll * dp[S0] * solve(S)) % mod;
	}
	ans = (ans + mod) % mod;
	printf("%d", ans);
	return 0;
}