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

const long long INF = 1e18;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    long long w_truck;
    int s, t;
    if (!(cin >> n >> m >> w_truck >> s >> t)) return 0;

    struct Edge {
        int v;
        long long w, l;
    };
    vector<vector<Edge>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        long long w, l;
        cin >> u >> v >> w >> l;
        adj[u].push_back({v, w, l});
    }

    vector<long long> dist(n + 1, INF);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<>> pq;
    dist[s] = 0;
    pq.push({0, s});

    while (!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();
        if (d > dist[u]) continue;
        for (auto& edge : adj[u]) {
            if (edge.l >= w_truck) {
                if (dist[u] + edge.w < dist[edge.v]) {
                    dist[edge.v] = dist[u] + edge.w;
                    pq.push({dist[edge.v], edge.v});
                }
            }
        }
    }
    if (dist[t] == INF) cout << -1 << "\n";
    else cout << dist[t] << "\n";
    return 0;
}