#include<bits/stdc++.h>
using namespace std;
const int mod=998244353,inv2=(mod+1)/2;
#define ll long long
#define pb push_back 
ll C,p2[70],i2[70];
void ad(ll &x,ll y){(x+=y)%=mod;}
ll cal(vector<ll>e){
	ll X=0;for(ll o:e)X^=o;
	ll su=0;
	for(int i=60;i>=0;i--){
		if(((X^C)>>i)&1)break;
		if(i==0){ad(su,1);continue;}
		ll dp[2]={1,0},ks[2]={0,0};
		ll gz=1;
		for(ll o:e){
			ll gp=((o&((1ll<<(i-1))-1))+1)%mod;
			gz=gz*gp%mod;
			ks[0]=ks[1]=0;
			for(int j=0;j<2;j++)if(dp[j]){
				if((o>>(i-1))&1)
					ad(ks[j],dp[j]*p2[i-1]),ad(ks[j^1],dp[j]*gp);
				else ad(ks[j],dp[j]*gp);
			}
			dp[0]=ks[0],dp[1]=ks[1];
		}
		(su+=(dp[(C>>(i-1))&1]-((((X^C)>>(i-1))&1)?0:gz))*i2[i-1])%=mod;
	}
	return su;
}
int n,m;
int fi[1<<15],pp[1<<15];
ll a[15],dp[1<<15][17],zp[1<<15];
int ts[20];
int jk(int l,int r){
	if(l>r)return 0;
	return ((1<<(r-l+1))-1)<<l;
}
int ct[1<<15];
bool A[15][15];
int be[15],rk[15]; 
int main(){
	p2[0]=i2[0]=1;
	for(int i=1;i<=60;i++)p2[i]=2*p2[i-1]%mod,i2[i]=i2[i-1]*inv2%mod;
	scanf("%d%d%lld",&n,&m,&C);
	for(int i=0;i<n;i++)scanf("%lld",&a[i]),be[i]=i;
	sort(be,be+n,[&](int x,int y){return a[x]<a[y];});
	sort(a,a+n);
	for(int i=0;i<n;i++)rk[be[i]]=i;
	for(int i=0,u,v;i<m;i++)scanf("%d%d",&u,&v),u=rk[u-1],v=rk[v-1],A[u][v]=A[v][u]=1;
	for(int s=0;s<(1<<n);s++){
		for(int i=0;i<n;i++)if((s>>i)&1)for(int j=i+1;j<n;j++)if((s>>j)&1)if(A[i][j])ct[s]++;
		for(int i=0;i<=n;i++)if(!((s>>i)&1)){fi[s]=i;break;}
		if(s)pp[s]=pp[s>>1]+(s&1);
	}
	zp[0]=1;
	for(int s=1;s<(1<<n);s++){
		zp[s]=(ct[s]?0:1);int x=(s&-s);
		for(int s2=s&(s-1);s2;s2=(s2-1)&s)if(s2&x){
			if(ct[s^s2])continue;
			ad(zp[s],-zp[s2]);
		}
	}
	for(int i=0;i<=n;i++)ts[i]=((1<<(n-i))-1)<<i;
	dp[0][0]=1;
	for(int i=0;i<n;i++)for(int s=0;s<(1<<n);s++)if(dp[s][i]){
		int S=ts[i];
		S^=(S&s);
		for(int s2=S;s2;s2=(s2-1)&S)if((s2>>i)&1){
			int j=fi[((1<<i)-1)|s2|s],s_=s|s2;
			s_^=(s_&jk(i,j-1));
			if(pp[s2]&1)ad(dp[s_|(1<<i)][j],dp[s][i]*zp[s2]);
			else ad(dp[s_][j],dp[s][i]*zp[s2]%mod*((a[i]+1)%mod));
		}
	}
	ll ans=0;
	for(int s=0;s<(1<<n);s++)if(dp[s][n]){
		vector<ll>X;for(int i=0;i<n;i++)if((s>>i)&1)X.pb(a[i]);
		ad(ans,dp[s][n]*cal(X));
	}
	return printf("%lld",ans),0;
}