/*
If you want to shine like a sun, first burn like a sun.
*/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds;
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define vpi vector<ppi>
#define ppl pair<ll,ll>
#define all(x) x.begin(),x.end()
#define ii int,int 
#define ff first    
#define ss second
#define forn(i,a,b) for(int i=a;i<b;i++)
#define forr(i,a,b) for(int i=a;i>=b;i--)
#define forv(i,m) for(auto i : m)
#define imx INT_MAX
#define imn INT_MIN
#define inf LONG_MAX
#define minf LONG_MIN
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sze size()
#define rvs reverse 
#define itr iterator 
#define pre cout<<fixed<<setprecision(10);
#define umap unordered_map
#define uset unordered_set
#define pi 3.141592653589793
const ll infinity = 9e18;

/*
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define MODM(a,b,md) ((a%md)*(b%md))%md
#define MODA(a,b,md) ((a%md)+(b%md))%md
#define ull unsigned long long int
*/

/*
bool compare(int a,int b) {return a > b;}
bool compare1(ppi a,ppi b) {return a.ff > b.ff;}
bool compare2(ppi a,ppi b) {return a.ss < b.ss;}
ll Npower(ll a,ll b) {ll product = 1; while(b){if(b&1){product = product*a;}a = a*a;b = b>>1;} return product;}
ll power(ll a,ll b,ll md) {ll product = 1; while(b){if(b&1){product = MODM(product,a,md);}a = MODM(a,a,md);b = b>>1;} return product%md;}
bool isprime(ll n){if(n < 2) return 0; ll i = 2; while(i*i <= n){if(n%i == 0) return 0; i++;} return 1;}
ll GCD(ll a,ll b) {return b==0 ? a:GCD(b,a%b);}
ll LCM(ll a,ll b) {return (a/GCD(a,b))*b; }
*/

int main()
{
    fast

/*
    #ifndef ONLINE_JUDGE
        freopen("in.txt",  "r",  stdin);
        freopen("out.txt", "w", stdout);
    #endif
//*/

        

        
    int n,m,fl;
    cin>>n>>m>>fl;    

    v2l v(n,vl(n,imx));

    int a,b,dis;
    forn(i,0,m)
    {
        cin>>a>>b>>dis;
        v[a-1][b-1] = dis;
        v[b-1][a-1] = dis;
    }

    forn(i,0,n)
    {
        v[i][i] = 0;
    }

/*    forn(i,0,n)
    {
        forn(j,0,n)
        {
            cout<<v[i][j]<<" ";
        }
        cout<<endl;
    }

*/
    v2l dp = v;

    forn(k,0,n)
    {
        forn(i,0,n)
        {
            forn(j,0,n)
            {
                if(dp[i][j] > (dp[i][k] + dp[k][j]))
                {
                    dp[i][j] = (dp[i][k] + dp[k][j]);
                }
            }
        }
    }

    forn(i,0,n)
    {
        forn(j,0,n)
        {
            // cout<<dp[i][j]<<" ";
            if(dp[i][j] <= fl) dp[i][j] = 1;
            else dp[i][j] = imx;
        }
        // cout<<endl;
    }

    forn(k,0,n)
    {
        forn(i,0,n)
        {
            forn(j,0,n)
            {
                if(dp[i][j] > (dp[i][k] + dp[k][j]))
                {
                    dp[i][j] = (dp[i][k] + dp[k][j]);
                }
            }
        }
    }

    int q;
    cin>>q;

    forn(i,0,q)
    {
        cin>>a>>b;
        if(dp[a-1][b-1] == imx) dp[a-1][b-1] = 0;
        cout<<dp[a-1][b-1]-1<<endl;
    }




    return 0;
}

Measured memory_bytes: 1920