#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define MP make_pair
#define VI vector<int>
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}

template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=3e2+5;
const ll MOD=1000000007;
const ll INF=(ll)1e18;

struct state{
    ll cnt,rem;
    bool operator < (const state &a) const {
        if (cnt != a.cnt) {
            return cnt > a.cnt;
        }
        else {
            return rem < a.rem;
        }
    }
};
ll n,m,l;
vector<ii> e[MAXn];
state dis[MAXn][MAXn];
bitset<MAXn> vis;
void dij(ll root) {
    REP (i,n) {
        dis[root][i] = (state){INF,INF};
    }
    vis.reset();
    dis[root][root] = (state){0,l};
    priority_queue<pair<state,ll> > pq;
    pq.push({dis[root][root],root});
    REP (i,n) {
        ll tp = -1;
        while (SZ(pq) && vis[tp = pq.top().Y]) pq.pop();
        if (tp == -1) break;
        vis[tp] = true;
        for (auto it:e[tp]) {
            ll nxt = it.X, w = it.Y;
            state to;
            if (w > dis[root][tp].rem) {
                to = (state){dis[root][tp].cnt+1,l-w};
            }
            else {
                to = (state){dis[root][tp].cnt,dis[root][tp].rem-w};
            }
            if (dis[root][nxt] < to) {
                dis[root][nxt] = to;
                pq.push(pair<state,ll>(dis[root][nxt],nxt));
            }
        }
    }
}
int main(){
    IOS();
    cin >> n >> m >> l;
    REP (i,m) {
        ll u,v,w;
        cin >> u >> v >> w;
        if (w > l) continue;
        u--, v--;
        e[u].eb(v,w);
        e[v].eb(u,w);
    }
    REP (i,n) dij(i);
    ll q;
    cin >> q;
    while (q--) {
        ll s,t;
        cin >> s >> t;
        s--, t--;
        if (dis[s][t].cnt == INF) cout << -1 << endl;
        else cout << dis[s][t].cnt << endl;
    }
}


Measured memory_bytes: 4352