#include<bits/stdc++.h>
using namespace std;
int T;
long long answ=1,ans,p,tim,v,n,m,brr;
long long a[10000001],b[10000001],c[10000001],d[10000001],x[10000001];
int mod=1000000007;
void clear(){
	for(int i=1;i<=n;i++){
		c[i]=0;
		d[i]=0;
		x[i]=0;
	}
}
void bitclear(){
	for(int i=1;i<=n;i++){
		a[i]=0;
		b[i]=0;
		x[i]=0;
	}
}
int main(){
	freopen("assign.in","r",stdin);
	freopen("assign.out","w",stdout);
	cin>>T;
	for(int t=1;t<=T;t++){
		cin>>n>>m>>v;
		if(v==2){
			answ=1;
			brr=0;
			for(int i=1;i<=m;i++){
				cin>>c[i]>>d[i];
				if(x[c[i]]!=0&&x[c[i]]!=d[i]){
					brr=1;
				}
				x[c[i]]=d[i];
			}
			if(brr==1){
				cout<<0<<endl;
				clear();
				continue;
			}
			for(int k=1;k<=n-1;k++){
				ans=0;
				for(int i=1;i<=2;i++){
					for(int j=1;j<=2;j++){
						a[k]=i;
						b[k]=j;
						if(x[k]!=0&&x[k]==a[k]){
						
							if(x[k+1]==0){
								x[k+1]=b[k];
							}else{
								if(x[k+1]!=b[k]){
									continue;
								}
							}
						}
						bitclear();
						ans++;
					}
				}
				answ*=ans;
				ans%=mod;
			}
			cout<<answ%mod<<endl;
		}else{
			if(v==1){
				cout<<1<<endl;
			}else{
				answ=1;
				p=0;
				tim=0;
				for(int i=1;i<=m;i++){
					cin>>c[i]>>d[i];
					x[c[i]]=d[i];
				}
				tim=(v*v)%1000000007;
				p=tim;
				for(int i=1;i<=n-2;i++){
					p*=tim;
					p%=1000000007;
				}
				cout<<p<<endl;
			}
		}	
	}
	return 0;
}