#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using Int = long long;
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<Int, Int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
Int get_msb(long long x) {
    assert(x != 0);
    return 63 - __builtin_clzll(x);
}
Int get_lsb(long long x) {
    assert(x != 0);
    return __builtin_ctzll(x);
}
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, const vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, const vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, const pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T> ostream& operator<<(ostream& s, const set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T> ostream& operator<<(ostream& s, const multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, const map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, const unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct FastIO { FastIO() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast_io;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr Int MOD = 1000000007;
// **********************************************************************************************
// **********************************************************************************************
// **********************************************************************************************
// **************************************** TEMPLATE END ****************************************
// **********************************************************************************************
// **********************************************************************************************
// **********************************************************************************************

Int L;
class UndirectedGraph {
    struct Edge {
        Int to, cost;
    };

public:
    vector<vector<Edge>> G;
    Int V;
    UndirectedGraph(Int V) : G(V), V(V) {}
    void add_edge(Int u, Int v, Int cost) {
        G[u].push_back({v, cost});
        G[v].push_back({u, cost});
    }
    vector<ii> dijkstra(Int s) {
        vector<ii> d(V, {1e18, 1e18});
        d[s] = {0, 0};
        using ii_i = pair<ii, Int>;
        priority_queue<ii_i, vector<ii_i>, greater<ii_i>> q;
        // priority_queue<pair<Int, Int>, vector<pair<Int, Int>>, greater<pair<Int, Int>>> que;  // {dist, v}
        // que.push({0, s});
        q.push({{0, 0}, s});
        while (!q.empty()) {
            auto p = q.top();
            q.pop();
            Int v = p.second;
            if (d[v] < p.first) continue;  // 定数倍枝刈り
            for (Edge e : G[v]) {
                ii tmp = {d[v].fi, d[v].se + e.cost};
                if (tmp.se > L) {
                    tmp.fi++;
                    tmp.se = e.cost;
                }
                assert(tmp.se <= L);
                if (d[e.to] <= tmp) continue;
                d[e.to] = tmp;
                q.push({tmp, e.to});
            }
        }
        return d;
    }
};

signed main() {
    Int n, m; cin >> n >> m >> L;
    UndirectedGraph g(n);
    REP (i, m) {
        int a, b, c; cin >> a >> b >> c;
        a--, b--;
        if (c <= L) g.add_edge(a, b, c);
    }
    vector<vector<ii>> ans(n);
    REP (i, n) {
        ans[i] = g.dijkstra(i);
    }
    Int Q; cin >> Q;
    while (Q--) {
        Int s, t; cin >> s >> t;
        s--, t--;
        cout << (ans[s][t].fi == 1e18 ? -1 : ans[s][t].fi) << endl;
    }
}


Measured memory_bytes: 4352