#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=205;
int n,m,q;
ll mod;
ll ans[N][N],g[N][N],a[N][N],c[N][N];
int u,v,d;
void add(ll x[N][N],ll y[N][N],int op){
	memset(c,0,sizeof(c));
	for(int k=1;k<=n;k++){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(i==v) continue;
				if(j==u) continue;
				if(k==u||k==v) continue;
				c[i][j]+=x[i][k]*y[k][j]%mod;
				c[i][j]%=mod;
			}
		}
	}
	if(op==1) memcpy(ans,c,sizeof(ans));
	else memcpy(a,c,sizeof(a));
}
int main(){
	freopen("messenger.in","r",stdin);
	freopen("messenger.out","w",stdout);
	ios::sync_with_stdio(0);
	cin>>n>>m>>mod;
	for(int i=1;i<=m;i++){
		int a,b;
		cin>>a>>b;
		g[a][b]=1;
	}
	cin>>q;
	while(q--){
		cin>>u>>v>>d;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				ans[i][j]=a[i][j]=g[i][j]%mod;
			}
		}
		d--;
		while(d){
			if(d&1){
				add(ans,a,1);
			}
			add(a,a,2);
			d>>=1;
		}
		cout<<ans[u][v]%mod<<"\n";
	}
	return 0;
}