#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
#define int ll
#define N 22
using namespace std;
int dp[N][1<<N];
int pw[100005];
int f[N][N];
int F[1<<N];
int n,m,s,t;
int sm[N];
int q;
inline ll quickPower(ll x,ll y)
{
	ll res=1;
	while (y)
	{
		if (y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
void BellaKira()
{
	pw[0]=1;
	for (int i=1;i<=10000;i++) pw[i]=pw[i-1]*2%mod;
	cin>>n>>m;
	cin>>s>>t;
	s--,t--;
	for (int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		x--,y--;
		f[x][y]++;
	}
	for (int i=0;i<n;i++)
		if (i!=s&&i!=t)
			dp[i][(1<<i)]=1;
	for (int i=0;i<(1<<n);i++)
		for (int x=0;x<n;x++)
			if ((i>>x)&1)
				if (dp[x][i])
				{
					// cout<<x<<" "<<bitset<5>(i)<<" "<<dp[x][i]<<endl;
					for (int y=0;y<n;y++)
						if (y!=s&&y!=t&&!((i>>y)&1))
						{
							int v=dp[x][i]*(pw[f[y][x]]-1+mod)%mod;
							dp[y][i|(1<<y)]=(dp[y][i|(1<<y)]+v
							>=mod?dp[y][i|(1<<y)]+v-mod:dp[y][i|(1<<y)]+v);
						}
				}
	for (int i=0;i<(1<<n);i++)
		for (int x=0;x<n;x++)
		{
			int coef=dp[x][i]*(pw[f[s][x]]-1+mod)%mod;
			dp[x][i]=coef;
			sm[i]=(sm[i]+coef>=mod?sm[i]+coef-mod:sm[i]+coef);
		}
	F[0]=(pw[f[s][t]]+mod)%mod;
	for (int i=1;i<(1<<n);i++)
		if (!((i>>s)&1)&&!((i>>t)&1))
		{
			int t=__lg(i);
			for (int j=i;j;j=(j-1)&i)
			{
				if (!((j>>t)&1)) break;
				F[i]=(F[i]+F[i^j]*sm[j]%mod)%mod;
			}
		}
	for (int j=0;j<n;j++)
		for (int i=0;i<(1<<n);i++)
			if ((i>>j)&1)
				F[i]=(F[i]+F[i-(1<<j)])%mod;
	cin>>q;
	int ful=(1<<n)-1-(1<<s)-(1<<t);
	// cout<<F[ful]<<endl;
	while (q--)
	{
		int x;
		cin>>x;
		x--;
		// cout<<"??"<<x<<endl;
		if (x==s)
		{
			cout<<0<<'\n';
			continue;
		}
		if (x==t)
		{
			cout<<F[(1<<n)-1-(1<<s)-(1<<t)]*quickPower(pw[f[s][t]],mod-2)%mod
			*(pw[f[s][t]]-1+mod)%mod<<'\n';
			continue;
		}
		int ans=0;
		for (int i=0;i<(1<<n);i++)
			if ((i>>x)&1)
				if (dp[x][i])
					ans=(ans+F[ful^i]*dp[x][i]%mod)%mod;
		cout<<ans<<'\n';
	}
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}