#include<bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,(v).size())
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define bit(n)(1ll<<(n))
#define F first
#define S second
#define endl '\n'
#define cho(n,a,b)cout<<((n)?a:b)<<endl
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
void _print(ostream&){}template<class T,class...U>void _print(ostream&s,const T&t,const U&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(const T&...t){_print(cout,t...);}template<class...T>void dprint(const T&...t){_print(cerr,t...);}
#ifndef LOCAL
struct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;
#define dprint(...)
#define cerr cer_
#endif
template<class T>bool chmax(T&a,const T&b){bool x=a<b;x?a=b:b;return x;}template<class T>bool chmin(T&a,const T&b){bool x=a>b;x?a=b:b;return x;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}
template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}
template<class T>class iterable{static false_type c(string v);template<class U>static auto c(U v)->decltype(all(v),true_type());static false_type c(...);public:const static bool value=decltype(c(declval<T>()))::value;};
template<class T,typename=enable_if_t<iterable<T>::value>>ostream&operator<<(ostream&o,const T&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}
template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T>set<T>&operator<<(set<T>&v,const T&t){v.insert(t);return v;}
template<class T>multiset<T>&operator<<(multiset<T>&v,const T&t){v.insert(t);return v;}

vvl _g;

inline ll& g(int a, int b){
    if(a>b)swap(a,b);
    return _g[a][b];
}


int main(){
    cin.tie(0);ios::sync_with_stdio(0);
    cout<<setprecision(10);
    ll n,m,l;
    cin>>n>>m>>l;
    _g.resize(n, vl(n, l+1));

    REP(i,n)g(i,i)=0;
    REP(i,m){
        int a,b,c;
        cin>>a>>b>>c;
        --a;--b;
        if(c<=l){
            g(a,b)=c;
        }
    }

    REP(k,n){
        REP(i,n){
            if(i==k)continue;
            REP(j,i+1,n){
                if(j==k)continue;
                chmin(g(i,j), g(i,k)+g(k,j));
            }
        }
    }
    REP(i,n)
        dprint(_g[i]);



    REP(i,n){
        REP(j,i+1,n){
            if(g(i,j)<=l)g(i,j)=1;
            else g(i,j)=LINF;
        }
    }

    REP(k,n){
        REP(i,n){
            if(i==k)continue;
            REP(j,i+1,n){
                if(j==k)continue;
                chmin(g(i,j), g(i,k)+g(k,j));
            }
        }
    }
    REP(i,n)
        dprint(_g[i]);

    int q;
    cin>>q;
    REP(i,q){
        int s,t;
        cin>>s>>t;
        ll ans=g(s-1,t-1);
        if(ans==LINF)ans=0;
        cout<<ans-1<<endl;
    }
}


Measured memory_bytes: 1280