// Skyqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 21, M = N * N + 1, P = 998244353;

int n, m, p, A[M], B[M], w[N], S, g[1 << N], inv[1 << N], h[N + 1][1 << N], f[N + 1][1 << N];

int inline power(int a, int b) {
	int ret = 1;
	while (b) {
		if (b & 1) ret = 1ll * ret * a % P;
		a = 1ll * a * a % P;
		b >>= 1;
	}
	return ret;
}

int d[N], fa[N];

int find(int x) {
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}

void inline merge(int x, int y) {
	fa[find(x)] = find(y);
}

bool inline chk(int x) {
	for (int i = 0; i < n; i++) d[i] = 0, fa[i] = i;
	for (int i = 1; i <= m; i++) {
		int u = A[i], v = B[i];
		if ((x >> u & 1) && (x >> v & 1)) {
			merge(u, v);
			d[u]++, d[v]++;
		}
	}
	int u = 0;
	while (!(x >> u & 1)) u++;
	for (int i = 0; i < n; i++) {
		if ((x >> i & 1)) {
			if ((d[i] & 1) || find(i) != find(u)) {
				return 0;
			}
		}
	}
	return 1;
}

void inline red(int &x) {
	if (x >= P) x -= P;
	if (x < 0) x += P;
}

void inline OR(int *a, int o) { 
	for (int k = 1; k < (1 << n); k <<= 1) {
		for (int i = 0; i < (1 << n); i += (k << 1)) {
			for (int j = 0; j < k; j++) {
				red(a[i + j + k] += o * a[i + j]);
			}
		}
	}
} 



int main() {
	read(n), read(m); read(p);
	for (int i = 1; i <= m; i++) {
		read(A[i]), read(B[i]);
		A[i]--, B[i]--;
	}
	for (int i = 0; i < n; i++) read(w[i]);
	S = (1 << n) - 1;
	for (int i = 1; i <= S; i++) {
		int c = 0;
		for (int j = 0; j < n; j++)
			if (i >> j & 1) c += w[j];
		g[i] = power(c, p);
		inv[i] = power(g[i], P - 2);
		if (!chk(i)) h[__builtin_popcount(i)][i] = g[i];
	}
	f[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		OR(f[i - 1], 1), OR(h[i], 1);
		for (int j = 1; j <= i; j++) {
			for (int k = 0; k <= S; k++)
				f[i][k] = (f[i][k] + 1ll * h[j][k] * f[i - j][k]) % P;
		}
		OR(f[i], -1);
		for (int k = 0; k <= S; k++)
			f[i][k] = 1ll * f[i][k] * inv[k] % P;
	}
	printf("%d\n", f[n][S]);
    return 0;
}