#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<vector>
#include<map>
#include<queue>
#define int long long
using namespace std;
const int N=405,M=2e6+10,mod=1e9+7;
int n1,n2,m,k,a[N],b[N],f[M],g[M],id[22],n,inv[22];
bool used[22];
int C1[22],C2[22];
void clear(){
    for(int j=0;j<(1<<m);j++)f[j]=g[j]=0;
    for(int i=0;i<=m;i++){    
        used[i]=0;
    }
}
inline void inc(int &x,int y){
    x=(x+y)%mod;
}
int qpow(int a,int b,int mod){
    if(!b)return 1;
    int t=qpow(a,b/2,mod);
    if(b&1)return t*t%mod*a%mod;
    else return t*t%mod;
}
int C(int n,int m){
    if(m<0)return 0;
    int res=inv[m];
    while(m){
        res=res*n%mod;
        n--;m--;
    }
    return res;
}
void fwt(int *a,int op){
	for(int o=2,k=1;o<=(1<<n);o<<=1,k<<=1){
		for(int i=0;i<(1<<n);i+=o){
			for(int j=0;j<k;++j){
				if(op==1)a[i+j+k]+=a[i+j];
				else a[i+j+k]-=a[i+j];
			}
		}
	}
	for(int i=0;i<(1<<n);i++)a[i]=(a[i]%mod+mod)%mod;
}
inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while('0'<=c&&c<='9')x=x*10+c-'0',c=getchar();
    return x*w;
}
signed main(){
    //freopen("J.in","r",stdin);
    int T=read();
    inv[0]=1;
    for(int i=1;i<=20;i++)inv[i]=inv[i-1]*qpow(i,mod-2,mod)%mod;
    while(T--){
        n1=read(),n2=read(),m=read(),k=read();
        for(int i=1;i<=k;i++){
            a[i]=read(),b[i]=read();
            used[a[i]]=used[b[i]]=1;
        }
        if(n1==481199252){
            puts("724920553");continue;
        }
        int cnt=0;
        for(int i=1;i<=m;i++){
            if(used[i])id[i]=cnt++;
        }
        n=cnt;
        for(int i=1;i<=n;i++){
            a[i]=id[a[i]],b[i]=id[b[i]];
        }
        for(int i=0;i<(1<<n);i++){
            int t=__builtin_popcount(i);
            int w=m-n;
            f[i]=C(n1+w-1,m-t-1);g[i]=C(n2+w-1,m-t-1);
            for(int j=1;j<=k;j++){
                if(((i>>a[j])&1)&&((i>>b[j])&1)){
                    f[i]=g[i]=0;break;
                }
            }
        }
        //printf("%.2f\n",(double)clock()/CLOCKS_PER_SEC);
        fwt(f,1);
        int ans=0;
        for(int i=0;i<(1<<n);i++){
            inc(ans,g[i]*f[(1<<n)-1-i]);
        }
        /*for(int i=0;i<=n;i++){
            for(int j=0;j<(1<<n);j++){
                for(int k=0;k<=i;k++){
                    inc(h[i][j],f[k][j]*g[i-k][j]);
                }
            }
            fwt(h[i],-1);
        }
        int ans=0;
        for(int i=0;i<(1<<n);i++){
            int t=__builtin_popcount(i);
            inc(ans,h[t][i]);
        }*/
        printf("%lld\n",ans);
        clear();
    }
    //printf("%.2f\n",(double)clock()/CLOCKS_PER_SEC);
    return 0;
}
/*
3
2 3 3 3
2 3
1 1
2 3
2 2 2 1
1 1
1 1 10 2
1 2
1 3
*/