#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

// struct NodeWithPriority {
//     lint node, num_fills, used_fuel;
//     NodeWithPriority(lint node, lint num_fills, lint used_fuel) {
//         this->node = node;
//         this->num_fills = num_fills;
//         this->used_fuel = used_fuel;
//     }
// };

using NodeWithPriority = pair<plint, lint>;

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N, M, L; cin >> N >> M >> L;
    vec<vec<plint>> adj(N, vec<plint>());
    range(i, 0, M) {
        lint a, b, c; cin >> a >> b >> c;
        a--; b--;
        if (c > L) continue;
        adj[a].emplace_back(b, c);
        adj[b].emplace_back(a, c);
    }

    // dijkstra. O(N^3logN). TLE for now.
    // use lint -> int probably leads to a faster execution.
    vec<vec<plint>> d(N, vec<plint>(N, {1LL << 58, 1LL << 58}));
    range(s, 0, N) {
        d[s][s] = {0, 0};
        priority_queue<NodeWithPriority, vec<NodeWithPriority>, greater<NodeWithPriority>> pq;
        pq.push({plint(0, 0), s});
        while (!pq.empty()) {
            lint node, num_fills, used_fuel;
            const NodeWithPriority top = pq.top();
            node = top.second; num_fills = top.first.first; used_fuel = top.first.second;
            pq.pop();
            if (d[s][node] < plint(num_fills, used_fuel)) continue;
            for (const auto& p : adj.at(node)) {
                lint neighbor, distance;
                tie(neighbor, distance) = p;
                plint state_node_to_neighbor =
                    L - used_fuel >= distance ? make_pair(num_fills, used_fuel + distance) : make_pair(num_fills + 1, distance);
                if (state_node_to_neighbor < d[s][neighbor]) {
                    d[s][neighbor] = state_node_to_neighbor;
                    pq.push({plint(state_node_to_neighbor.first, state_node_to_neighbor.second), neighbor});
                }
            }
        }
    }
    int Q; cin >> Q;
    range(i, 0, Q) {
        int s, t; cin >> s >> t;
        s--; t--;
        cout << (d[s][t].first != (1LL << 58) ? d[s][t].first : -1LL) << "\n";
    }
}


Measured memory_bytes: 5656