#include<bits/stdc++.h>
#define mp make_pair
#define fr first
#define sc second
using namespace std;
typedef long long ll;
const ll mod=998244353;
const ll inv2=(mod+1)/2ll;
const int maxn=4e6+5;
const int maxS=(1<<20)+5;
bool con[maxS];
bool g[20][20];
ll lm[20];
ll lim[20];
int n,m;
ll c;
ll f[20][2][2],a[20];
ll ipw[maxn];
ll calc(ll *l,int N,ll C){
    ll ans=0;
    for(ll i=59;i>=0;i--){
    	for(int j=1;j<=N;j++){
            for(int a=0;a<=1;a++){
                for(int b=0;b<=1;b++){
                    f[j][a][b]=0;
                }
            }
        }
        f[0][0][0]=1;
        for(int j=1;j<=N;j++){
            if((l[j]&(1ll<<i))){
                ll s1=((1ll<<i))%mod,s2=(l[j]-s1)%mod;
                f[j][0][0]=f[j-1][0][1]*s2%mod;
                f[j][0][1]=f[j-1][0][0]*s2%mod;
                f[j][1][0]=(f[j-1][0][0]*s1%mod+f[j-1][1][1]*s2%mod+f[j-1][1][0]*s1%mod)%mod;
                f[j][1][1]=(f[j-1][0][1]*s1%mod+f[j-1][1][0]*s2%mod+f[j-1][1][1]*s1%mod)%mod;
            }
            else{
                for(int a=0;a<=1;a++){
                    for(int b=0;b<=1;b++){
                        f[j][a][b]=f[j-1][a][b]*(l[j]%mod)%mod;
                    }
                }
            }
        }
    	if((C&(1ll<<i)))ans=(ans+f[N][1][1]*ipw[i]%mod)%mod;
        else ans=(ans+f[N][1][0]*ipw[i]%mod)%mod;
    	int cnt=0;
        for(int j=1;j<=N;j++){
            if((l[j]&(1ll<<i))){
                cnt++;
                l[j]^=(1ll<<i);
            }
        }
        if(((cnt&1)^((C>>i&1))))return ans;
    }
    return ans;
}
#define lowbit(i) ((i)&(-(i)))
ll dp[maxn*3],pw[maxn],xs[maxn];
int ch[maxS],lg[maxS];
int popcnt[maxn];
int id[maxn];
pair<ll,int>tmp[maxn];
int main(){
    ipw[0]=1;
    for(int i=1;i<maxn;i++)ipw[i]=ipw[i-1]*inv2%mod;
    pw[0]=1;
    for(int i=1;i<maxn;i++)pw[i]=pw[i-1]*3ll%mod;
    for(int i=1;i<maxS;i++)ch[i]=ch[i>>1]*3ll+(i&1),popcnt[i]=popcnt[i>>1]+(i&1);
    for(int i=1;(1<<(i-1))<maxS;i++)lg[(1<<i-1)]=i;
    scanf("%d%d%lld",&n,&m,&c);
    for(int i=1;i<=n;i++)scanf("%lld",&lim[i]),lim[i]++,tmp[i]=mp(lim[i],i);
    sort(tmp+1,tmp+n+1);
    sort(lim+1,lim+n+1);
    if(m==0){
        cout<<calc(lim,n,c)<<endl;
        return 0;
    }
    for(int i=1;i<=n;i++)id[tmp[i].sc]=i;
    for(int i=1,u,v;i<=m;i++){
        scanf("%d%d",&u,&v);
        g[id[u]][id[v]]=g[id[v]][id[u]]=1;
    }
    for(int S=0;S<(1<<n);S++){
        for(int i=1;i<=n;i++){
            if(!(S&(1<<i-1)))continue;
            for(int j=1;j<=n;j++){
                if(!(S&(1<<j-1)))continue;
                if(i==j)continue;
                if(g[i][j])con[S]=1;
            }
        }
    }
    for(int S=1;S<(1<<n);S++){
    	xs[S]=0;        
        if(!con[S])xs[S]=1;
        int ts=(S^(lowbit(S)));
    	for(int T=ts;T;T=((T-1)&ts)){ 
    		if(!con[T])xs[S]=(xs[S]-xs[S^T]+mod)%mod;
    	}
        // cout<<S<<" "<<xs[S]<<endl;
    }
    dp[0]=1;
    int cnt=0;
    int all=(1<<n)-1;
    for(int S=0;S<pw[n];S++){
        if(!dp[S])continue;
        // if(2000<=S&&S<=2500)cout<<S<<" "<<dp[S]<<endl;
        int ts=0,T=S;
        for(int i=n-1;i>=0;i--){
            if(T>=pw[i]){
                ts+=(1<<i); 
                T%=pw[i];
            } 
        }
        ts=(all^ts);
        if(!ts)continue;
        int tts=(ts^(lowbit(ts)));
        // cout<<S<<" "<<tts<<endl;
        for(int tt=tts;;tt=((tt-1)&tts)){ 
            int T=(tt|(lowbit(ts)));
    		int news=S+ch[T];
            if(popcnt[T]&1){
                news+=ch[lowbit(ts)];
                dp[news]=(dp[news]+dp[S]*xs[T]%mod)%mod;
            }
            else{
                dp[news]=(dp[news]+dp[S]*xs[T]%mod*(lim[lg[lowbit(ts)]]%mod)%mod)%mod;
            } 
            if(!tt)break;
        }
    }
    ll ans=0;
    for(int S=0;S<(1<<n);S++){
        int ts=ch[S]+ch[all];
        if(!dp[ts])continue;
        int tt=0;
        for(int i=1;i<=n;i++){
            if((S&(1<<i-1)))lm[++tt]=lim[i];
        }
        ans=(ans+dp[ts]*calc(lm,tt,c)%mod)%mod;
    }
    cout<<ans;
    return 0;
}