#include<bits/stdc++.h>
using std::cin;
using std::cout;
using std::min;
using std::max;
using std::set;
using std::queue;
using std::sort;
using std::unique;
using std::vector;
using std::pair;
#define ll long long
#define db double
#define inf 0x3f3f3f3f
#define ull unsigned long long
#define F(i,l,r) for(int i=(l);i<=(r);i++)
#define UF(i,l,r) for(int i=(l);i>=(r);i--)
#define mp std::make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define ls(x) x<<1
#define rs(x) x<<1|1
#define pb push_back
inline ll rd(){
	ll f=1,x=0;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
	return f*x;
}
const int mo=998244353;
inline int qk(int x){return x>=mo?x-mo:x;}

int n,m,pw[15*15],mn[(1<<15)+5],e[(1<<15)+5],f[2][(1<<15)+5],g[2][(1<<15)+5];
int res[(1<<15)+5],tmp[15],dp[2][15];
ll C,a[15],ta[15];
std::unordered_map<int,int>ddp[(1<<15)+5];
void calc(int s){
	int N=0;
	F(i,0,n-1)if(s>>i&1)ta[N++]=a[i];
	UF(d,59,0){
		int c=C>>d&1,Sum=0,mul=1,len=0;
		ll tot=(1ll<<d+1)-1;
		F(i,0,N-1){
			if(ta[i]>>d&1)Sum^=1,tmp[len++]=i;
			else mul=1ll*mul*((ta[i]&tot)%mo+1)%mo;
		}
		bool flag=0;
		if(Sum!=c)flag=1;
		if(len){
			F(i,0,len-1){
				if(i)c^=1,mul=1ll*mul*((ta[tmp[i-1]]&(tot>>1))%mo+1)%mo;
				dp[c][i]=1;dp[c^1][i]=0;
				F(j,i+1,len-1)F(o,0,1){
					int v0=(1ll<<d)%mo,v1=(ta[tmp[j]]&(tot>>1))%mo+1;
					dp[o][j]=qk(1ll*dp[o][j-1]*v0%mo+1ll*dp[o^1][j-1]*v1%mo);
				}
				res[s]=qk(res[s]+1ll*mul*dp[0][len-1]%mo);
			}
		}
		if(flag)break;
		if(d==0)++res[s];
	}
}

int main(){
	n=rd();m=rd();C=rd();
	pw[0]=1;F(i,1,n*n)pw[i]=qk(pw[i-1]+pw[i-1]);
	F(i,0,n-1)a[i]=rd();
	F(i,1,m){
		int u=rd()-1,v=rd()-1;
		e[u]|=(1<<v);e[v]|=(1<<u);
	}
	F(i,0,n-1)mn[1<<i]=i;
	F(s,1,(1<<n)-1){
		mn[s]=-1;
		F(i,0,n-1)if(s>>i&1){
			if(mn[s]==-1||a[mn[s]]>a[i])mn[s]=i;
		}
	}
	f[0][0]=g[0][0]=1;
	F(s,1,(1<<n)-1){	
		int Nume=0,P=s&-s;
		F(i,0,n-1)if(s>>i&1)Nume+=__builtin_popcount(e[i]&s);
		if(!Nume)f[0][s]=1;else f[0][s]=f[1][s]=pw[(Nume>>1)-1];
		g[0][s]=f[0][s];g[1][s]=f[1][s];
		for(int t=s;t;t=(t-1)&s)if((t&P)&&t!=s){	
			g[0][s]=qk(g[0][s]-1ll*g[0][t]*f[0][s^t]%mo+mo);
			g[0][s]=qk(g[0][s]-1ll*g[1][t]*f[1][s^t]%mo+mo);
			g[1][s]=qk(g[1][s]-1ll*g[0][t]*f[1][s^t]%mo+mo);
			g[1][s]=qk(g[1][s]-1ll*g[1][t]*f[0][s^t]%mo+mo);
		}
	}
	F(i,1,(1<<n)-1)calc(i);
	ddp[0][0]=1;
	F(s,0,(1<<n)-1)for(auto e:ddp[s]){
		int t=e.fi,w=e.se;
		if(w){
			int lv=((1<<n)-1)^s,lw=lv&-lv;
			for(int t2=lv;t2;t2=(t2-1)&lv)if(t2&lw){
				if(__builtin_popcount(t2)&1)ddp[s^t2][t^(1<<mn[t2])]=qk(ddp[s^t2][t^(1<<mn[t2])]+1ll*w*(g[0][t2]-g[1][t2]+mo)%mo);
				else ddp[s^t2][t]=qk(ddp[s^t2][t]+1ll*w*((a[mn[t2]]+1)%mo)%mo*(g[0][t2]-g[1][t2]+mo)%mo);
			}
		}
		if(!t)break;
	}
	int ans=0;
	F(i,1,(1<<n)-1)ans=qk(ans+1ll*ddp[(1<<n)-1][i]*res[i]%mo);
	cout<<ans<<"\n"; 
	return 0;
}