#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
priority_queue<pair<int,int> > que;
int n,m,MOD;
int ans;
bool b[10004];
int dis[10004];
int w[105][105];
int u[105],v[105];
void floyed(int s,int t,int d){
    memset(w,0x3f,sizeof(w));
    for(int i=1;i<=m;i++){
        w[u[i]][v[i]]=1;
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(k==t||k==s||i==j||i==k||j==k) continue;
                if(w[i][j]>d){
                    w[i][j]=min(w[i][j],w[i][k]+w[k][j]);
                }
                if(w[i][j]<d){
                    if(w[i][k]!=0x3f3f3f3f&&w[k][j]!=0x3f3f3f3f&&w[i][j]!=0x3f3f3f3f){
                        w[i][j]=max(w[i][k]+w[k][j],w[i][j]);
                    }
                }
                if(w[i][j]==d&&i==s&&j==t){
                    ans++;
                    ans%=MOD;
                }
            }
        }
    }
}
int main(){
    freopen("messenger.in","r",stdin);
    freopen("messenger.out","w",stdout);
    cin>>n>>m>>MOD;
    memset(w,0x3f,sizeof(w));
    for(int i=1;i<=m;i++){
        cin>>u[i]>>v[i];
        w[u[i]][v[i]]=1;
    }
    int q;
    cin>>q;
    while(q--){
        int s,t,d;
        cin>>s>>t>>d;
        floyed(s,t,d);
        cout<<ans<<endl;
        ans=0;
    }
    return 0;
}