#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define stpr setprecision
#define rep(i,n) for(ll i=0;i<(n);++i)
#define REP(i,a,b) for(ll i=(a);i<(b);++i)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
    for(auto i=begin(v); i != end(v); ++i){
        if(i !=begin(v)) os << ' ';
        os << *i;
    }
    return os;
}

ll N,m,L,l,X,Y;
ll y;
ll dismin=INF*100;
vector<pair<ll,ll>> A[10007];   //A[i].firstはA[i]枝の先　A[i].secondは重さを表す
ll DKSTR[10007];   //距離の最小値を記入する
ll chek[10007];
ll M[307][307];

void dikstra(ll s,ll t,ll g){   // s始点　t初期値の重さ　g目的地　sからtへの最短距離を返す
    REP(i,0,N+1){
        chek[i]=0;
        DKSTR[i]=LINF;
    }
    DKSTR[s]=t;
    ll key=s;
    priority_queue <pair<ll,ll>> PQ;
    PQ.push(mp(t,s));
    while(PQ.empty()!=1){
        pair<ll,ll> f = PQ.top();
        PQ.pop();
        key=f.second;
        chek[key]=1;
        if(DKSTR[key] < f.first*(-1)){
            continue;
        }
        rep(j,A[key].size()){
            if(A[key][j].second<=L){
                ll v = A[key][j].first;
                if(L-(DKSTR[key]%10000000000)<A[key][j].second){
                    y=((DKSTR[key]/10000000000)+1)*10000000000+A[key][j].second;
                }
                else{
                    y=DKSTR[key]+A[key][j].second;
                }
                if(chek[v]==0 && DKSTR[v]>y){
                    DKSTR[v] = y;
                    PQ.push(mp(DKSTR[v]*(-1),v));
                }
            }
        }
    }
}

int main(){
    cin >> N >> m >> L;
    rep(i,m){
        cin >> X >> Y >> l;   // X=始点　Y=終点  L=重さ
        A[X].pb(mp(Y,l));
        A[Y].pb(mp(X,l));
    }
    ll Q,a,b;
    cin >> Q;
    REP(i,1,N+1){
        dikstra(i,0,i);
        REP(j,1,N+1){
            M[i][j]=DKSTR[j];
        }
    }
    rep(i,Q){
        cin >> a >> b;
        if(M[a][b]==LINF){
            cout << -1 << endl;
        }
        else{
            cout << M[a][b]/10000000000 << endl;
        }
    }
}

Measured memory_bytes: 3840