#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll M=1e4+10,N=100;
ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<48||c>57){
        if(c==45) f=-1;
        c=getchar();
    }
    while(c>=48&&c<=57){
        x=x*10+c-48;
        c=getchar();
    }
    return f*x;
}
ll n,m,z,q,d;
struct node{
    ll to,nxt;
}e[M];
ll h[N],tot;
void add(ll u,ll v){
    e[++tot].to=v;
    e[tot].nxt=h[u];
    h[u]=tot;
    return;
}
ll ans;
ll be,en;
void dfs(ll x,ll cnt){
    if(cnt>d) return;
    if(x==en){
        if(cnt==d) ans=(ans+1)%z;
        return;
    }
    ll v;
    for(ll i=h[x];i;i=e[i].nxt){
        v=e[i].to;
        dfs(v,cnt+1);
    }
    return;
}
int main(){
    freopen("messenger.in","r",stdin);
    freopen("messenger.out","w",stdout);
    n=read();m=read();z=read();
    ll u,v;
    for(ll i=1;i<=m;i++){
        u=read();v=read();
        add(u,v);
    }
    q=read();
    while(q--){
        u=read();v=read();d=read();
        ans=0;en=v;
        dfs(u,0);
        printf("%lld\n",ans);
    }
    return 0;
}