#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n,m,mod;
ll mp[110][110];
ll ans;
ll qq;
queue < pair<ll,ll> > q;

void bfs(ll u,ll v,ll d){
    q.push(make_pair(u,0));
    ll num=0;
    while(!q.empty()){
        ll x=q.front().first;
        ll y=q.front().second;
        q.pop();
        if (x==v){
            ans++;
            ans%=mod;
            continue;
        }
        if (y>=d) continue;
        for (int i=1;i<=n;i++){
            if (mp[x][i]){
                q.push(make_pair(i,y+1));
            }
        }
    }
}

int main(){
//    freopen("in.in","r",stdin);
    freopen("messenger.in","r",stdin);
    freopen("messenger.out","w",stdout);
    scanf("%lld %lld %lld",&n,&m,&mod);
    for (int i=1;i<=m;i++){
        int a,b;
        scanf("%d %d",&a,&b);
        mp[a][b]=1;
    }
    scanf("%lld",&qq);
    for (int i=1;i<=qq;i++){
        ll u,v,d;
        scanf("%lld %lld %lld",&u,&v,&d);
        ans=0;
        bfs(u,v,d);
        printf("%lld\n",(ans-1)%mod);
    }
    
    return 0;
}