#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr long double PI = 3.1415926535897932384626433832795028L;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

template<typename T>
struct warshall_floyd {
    int n;
    T zero, inf;
    std::vector<std::vector<int>> graph;
    warshall_floyd(int n, T zero = T(), T inf = std::numeric_limits<T>::max())
        : n(n), zero(zero), inf(inf), graph(n, std::vector<int>(n, inf)) {
        for (int i = 0; i < n; i++) { graph[i][i] = zero; }
    }
    void add_edge(int from, int to, T cost) { graph[from][to] = cost; }
    std::vector<std::vector<T>> get_dist() const {
        std::vector<std::vector<T>> dist(graph);
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (dist[i][k] == inf || dist[k][j] == inf) { continue; }
                    T next_dist = dist[i][k] + dist[k][j];
                    if (next_dist < dist[i][j]) { dist[i][j] = next_dist; }
                }
            }
        }
        return dist;
    }
};

int N, M, L;
int A[110000], B[110000], C[110000];
int Q;
int s[110000], t[110000];
signed main() {
    cin >> N >> M >> L;
    warshall_floyd<int> wf0(N + 1);
    rep(i, M) {
        cin >> A[i] >> B[i] >> C[i];
        wf0.add_edge(A[i], B[i], C[i]);
        wf0.add_edge(B[i], A[i], C[i]);
    }
    vvint d0 = wf0.get_dist();
    warshall_floyd<int> wf1(N + 1);
    reps(i, N) {
        reps(j, N) {
            if (i == j) { continue; }
            if (d0[i][j] <= L) { wf1.add_edge(i, j, 1); }
        }
    }
    vvint d1 = wf1.get_dist();
    cin >> Q;
    rep(i, Q) {
        cin >> s[i] >> t[i];
        int ans = d1[s[i]][t[i]];
        if (ans == LLONG_MAX) { ans = -1; }
        else { ans--; }
        cout << ans << endl;
    }
}


Measured memory_bytes: 7040