#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <array>
#include <bitset>
using namespace std;

typedef long long LL;

const int P = 998244353;

inline void add(int &a, const int &b) { a = (a + b >= P ? a + b - P : a + b); }
inline int aad(const int &a, const int &b) { return (a + b >= P ? a + b - P : a + b); }
inline void mul(int &a, const int &b) { a = 1ll * a * b % P; }
inline int mut(const int &a, const int &b) { return 1ll * a * b % P; }

const LL LINF = (LL)1e18 + 10;

const int NR = 15 + 5;

int n, m;
int ans = 0;
int pc[1 << 15];
int bel[NR];
int sz[NR], mnp[NR], msk[NR];
int f[2][NR];
int res[1 << 15];
int F[1 << 15], G[1 << 15];
int ec[1 << 15], emsk[NR];
LL C;
LL a[NR], b[NR];
LL lim[NR];
array<int,2> e[NR * NR];

inline int lowbit(int x) { return x & (-x); }

void solve(int now, int cnt) {
	if (now == n + 1) {
		for (int i = 1; i <= cnt; i++) sz[i] = mnp[i] = msk[i] = 0, lim[i] = LINF;
		for (int i = 1; i <= n; i++) {
			sz[bel[i]]++, msk[bel[i]] |= (1 << (i - 1));
			if (a[i] < lim[bel[i]]) mnp[bel[i]] = i, lim[bel[i]] = a[i];
		}
		int mask = 0, mu = 1;
		for (int i = 1; i <= cnt; i++)
			if (sz[i] % 2) mask |= (1 << (mnp[i] - 1));
			else mul(mu, (lim[i] + 1) % P);
		for (int i = 1; i <= cnt; i++) mul(mu, F[msk[i]]);
		add(ans, mut(mu, res[mask]));
		return;
	}
	for (int i = 1; i <= cnt; i++) bel[now] = i, solve(now + 1, cnt);
	bel[now] = cnt + 1, solve(now + 1, cnt + 1);
}

int main()
{
	ios::sync_with_stdio(0);

	for (int i = 1; i < (1 << 15); i++) pc[i] = pc[i >> 1] + (i & 1);

	cin >> n >> m >> C;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= m; i++) {
		int u, v; cin >> u >> v;
		e[i] = {u, v};
	}

	for (int S = 0; S < (1 << n); S++) {
		int cnt = 0;
		for (int i = 1; i <= n; i++)
			if (S & (1 << (i - 1))) b[++cnt] = a[i];

		for (int d = 59; d >= 0; d--) {
			bool c = (C >> d) & 1;

			f[0][cnt + 1] = 1, f[1][cnt + 1] = 0;
			for (int i = cnt; i >= 1; i--) {
				f[0][i] = f[1][i] = 0;
				bool u = (b[i] >> d) & 1;
				if (u) {
					add(f[0][i], mut(f[1][i + 1], ((b[i] & ((1ll << d) - 1)) + 1) % P));
					add(f[1][i], mut(f[0][i + 1], ((b[i] & ((1ll << d) - 1)) + 1) % P));
					add(f[0][i], mut(f[0][i + 1], (1ll << d) % P));
					add(f[1][i], mut(f[1][i + 1], (1ll << d) % P));
				} else {
					add(f[0][i], mut(f[0][i + 1], ((b[i] & ((1ll << d) - 1)) + 1) % P));
					add(f[1][i], mut(f[1][i + 1], ((b[i] & ((1ll << d) - 1)) + 1) % P));
				}
			}

			int pre = 1;
			bool cur = 0;
			for (int i = 1; i <= cnt; i++) {
				bool u = (b[i] >> d) & 1;
				if (!u) {
					mul(pre, ((b[i] & ((1ll << d) - 1)) + 1) % P);
					continue;
				}
				add(res[S], mut(pre, f[c ^ cur][i + 1]));
				mul(pre, ((b[i] & ((1ll << d) - 1)) + 1) % P), cur ^= 1;
			}
			if (cur != c) break;
		}

		LL sum = 0;
		for (int i = 1; i <= cnt; i++) sum ^= b[i];
		if (sum == C) add(res[S], 1);
	}

	for (int i = 1; i <= m; i++) {
		auto [u, v] = e[i];
		emsk[u] |= (1 << (v - 1)), emsk[v] |= (1 << (u - 1));
	}
	for (int S = 1; S < (1 << n); S++) {
		int t;
		for (int i = 1; i <= n; i++) if (S & (1 << (i - 1))) { t = i; break; }
		ec[S] = ec[S ^ (1 << (t - 1))] + pc[emsk[t] & S];
	}

	for (int S = 1; S < (1 << n); S++) {
		int lb = lowbit(S);
		for (int t = S; t; t = (t - 1) & S) {
			if (t == S || !(t & lb)) continue;
			add(G[S], mut(F[t], (ec[S - t] == 0)));
		}
		int s = (ec[S] == 0);
		F[S] = aad(s, P - G[S]);
	}

	solve(1, 0);

	cout << ans << '\n';

	return 0;
}