#include<iostream>
#include<cstdio>
#define N 20
#define mod 998244353
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int lowbit(int x)
{
    return x&(-x);
}
int MD2(int x)
{
    return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int n,m,q,s,t,ans,c1[N+1],c2[N+1],sz[1<<N],inv[N+1],E[N+1][N+1],dp[1<<N][N+1],F[N+1][1<<N],G[N+1][1<<N],delta[1<<N];
int get(int x)
{
    return x-(x>s)-(x>t);
}
void FWT(int *s,int type)
{
    if (type==1)
    {
	for (int i=1;i<=n;++i)
	    for (int j=0;j<(1<<n);++j)
		if (j&(1<<(i-1)))
		    Adder(s[j],s[j^(1<<(i-1))]);
    }
    else
    {
	for (int i=1;i<=n;++i)
	    for (int j=0;j<(1<<n);++j)
		if (j&(1<<(i-1)))
		    Adder2(s[j],-s[j^(1<<(i-1))]);
    }
    return;
}
int main()
{
    int x,y,cnt=0;
    n=read()-2,m=read(),s=read(),t=read(),inv[1]=1;
    for (int i=2;i<=n;++i) inv[i]=MD2(-1ll*(mod/i)*inv[mod%i]%mod);
    for (int i=1;i<(1<<n);++i) sz[i]=sz[i-lowbit(i)]+1;
    for (int i=1;i<=m;++i)
    {
	x=read(),y=read();
	if (x!=y)
	{
	    if (x==s&&y==t) cnt++;
	    else if (x==s) Adder(c1[get(y)],1);
	    else if (y==t) Adder(c2[get(x)],1);
	    else if (x!=t&&y!=s) Adder(E[get(x)][get(y)],1);
	}
    }
    for (int i=1;i<=n;++i) dp[1<<(i-1)][i]=c2[i];
    for (int i=0;i<(1<<n);++i)
	for (int j=1;j<=n;++j)
	    if (i&(1<<(j-1)))
		for (int k=1;k<=n;++k)
		    if ((!(i&(1<<(k-1)))))
			Adder(dp[i|(1<<(k-1))][k],1ll*dp[i][j]*E[k][j]%mod);
    for (int i=0;i<(1<<n);++i)
	for (int j=1;j<=n;++j)
	    if (i&(1<<(j-1)))
		Adder(F[sz[i]][i],1ll*dp[i][j]*c1[j]%mod);
    for (int i=0;i<=n;++i) FWT(F[i],1);
    for (int i=0;i<(1<<n);++i)
    {
	G[0][i]=1;
	for (int j=1;j<=n;++j)
	{
	    for (int k=1;k<=j;++k) Adder(G[j][i],1ll*G[j-k][i]*F[k][i]%mod*k%mod);
	    G[j][i]=1ll*G[j][i]*inv[j]%mod;
	}
    }
    for (int i=0;i<=n;++i) FWT(G[i],-1);
    for (int i=0;i<(1<<n);++i) delta[i]=G[sz[i]][i];
    for (int i=1;i<=n;++i)
	for (int j=0;j<(1<<n);++j)
	    if (j&(1<<(i-1)))
		Adder(delta[j],delta[j^(1<<(i-1))]);
    q=read();
    while (q--)
    {
	x=read(),ans=0;
	if (x==t) Adder(ans,1ll*delta[(1<<n)-1]*cnt%mod);
	else
	{
	    x=get(x);
	    for (int i=0;i<(1<<n);++i)
		if (i&(1<<(x-1)))
		    Adder(ans,1ll*dp[i][x]*c1[x]%mod*delta[((1<<n)-1)^i]%mod*(cnt+1)%mod);
	}
	printf("%d\n",ans);
    }
    return 0;
}