#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,mod,q,u,v,d,x,y,ans;
struct node{
    int x,step;
}c;
vector<int>g[555];
void bfs(){
    queue<node>q;
    q.push({u,0});
    while(!q.empty()){
        c=q.front();q.pop();
        if(c.step==d){
            if(c.x==v){
                ans++;
                ans%=mod;
            }
            continue;
        }
        x=c.x;
        for(int i=0;i<g[x].size();i++){
            y=g[x][i];
            q.push({y,c.step+1});
        }
    }
    return;
}
signed main(){
    freopen("messenger.in","r",stdin);freopen("messenger.out","w",stdout);
    scanf("%lld%lld%lld",&n,&m,&mod);
    for(int i=i;i<=m;i++){
        scanf("%lld%lld",&x,&y);
        g[x].push_back(y);
    }
    scanf("%lld",&q);
    while(q--){
        ans=0;
        scanf("%lld%lld%lld",&u,&v,&d);
        bfs();
        printf("%lld\n",ans%mod);
    }
    return 0;
}