/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[100][100];

ll cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
 
//-----------------------ここから-----------
struct Edge{
    ll from;
    ll to;
    ll cost;
};
int main(void){
    ll n, m, l;
    cin >> n >> m >> l;
    vector<vector<Edge>> g(n);
    rep(i, m){
        ll a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        Edge tmp;
        tmp.from = a;
        tmp.to = b;
        tmp.cost = c;
        g[a].push_back(tmp);
        swap(tmp.from, tmp.to);
        g[b].push_back(tmp);
    }
    vector<vector<ll>> ans(n, vector<ll>(n, INF));
    rep(i, n){
        ans[i][i] = 0;
    }

    rep(i, n){
        priority_queue<pair<pair<ll,ll>,ll>, vector<pair<pair<ll,ll>,ll>>, greater<pair<pair<ll,ll>,ll>>> que;
        que.push({{0, 0}, i});

        vector<pair<ll,ll>> dist(n, {INF, INF});
        dist[i] = {0, 0};

        while(!que.empty()){
            ll now = que.top().second;
            ll nowr = que.top().first.first;
            ll nowf = que.top().first.second;
            que.pop();
            if(dist[now] < make_pair(nowr, nowf)) continue;
            rep(j, g[now].size()){
                Edge next = g[now][j];
                if(next.cost > l) continue;
                ll nextf = nowf + next.cost;
                if(nextf > l){
                    if(dist[next.to] <= make_pair(nowr + 1, next.cost))continue;
                    dist[next.to] = {nowr + 1, next.cost};
                    que.push({{nowr + 1, next.cost}, next.to}); 
                } else {
                    if(dist[next.to] <= make_pair(nowr, nextf)) continue;
                    if(dist[next.to].first < nowr){
                        continue;
                    } else if(dist[next.to].first == nowr) {
                        if(dist[next.to].second < nextf){
                            continue;
                        }
                    }
                    dist[next.to] = {nowr, nextf};
                    que.push({{nowr, nextf}, next.to}); 
                }
            }
        }
        rep(j, n){
            ans[i][j] = dist[j].first;
        }
    }
    ll q;
    cin >> q;
    rep(i, q){
        ll s, t;
        cin >> s >> t;
        s--, t--;
        cout << (ans[s][t]>=INF?-1:ans[s][t]) << endl;
    }
}

Measured memory_bytes: 6080