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

template <class T> struct Kruskal_dsu {
    public:
    Kruskal_dsu() : _n(0) {}
    Kruskal_dsu(int n) : _n(n), num_component(n), parent_or_size(n, -1), 
                         dat(n, std::numeric_limits<T>::max()) {}

    bool merge(int u, int v, T w) {
        assert(0 <= u && u < _n);
        assert(0 <= v && v < _n);
        int x = leader(u), y = leader(v);
        if (x == y) return false;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        dat[y] = w;
        num_component--;
        return true;
    }

    bool same(int u, int v) {
        assert(0 <= u && u < _n);
        assert(0 <= v && v < _n);
        return leader(v) == leader(u);
    }

    int leader(int v) {
        assert(0 <= v && v < _n);
        while(parent_or_size[v] >= 0) v = parent_or_size[v];
        return v;
    }

    int size() {
        return num_component;
    }

    int size(int v) {
        assert(0 <= v && v < _n);
        return -parent_or_size[leader(v)];
    }

    T max_edge(int u, int v){
        T ans = 0;
        while(u != v){
            if (dat[u] > dat[v]) std::swap(u, v);
            ans = dat[u], u = parent_or_size[u];
            if(u < 0) return -1;
        }
        return ans;
    }

    private:
    int _n, num_component;
    // root node: -1 * component size

    // otherwise: parent

    std::vector<int> parent_or_size;
    std::vector<T> dat;
};
using T = tuple<int,int,int,int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll C, c = 0;
    int N, K, ans = 0, id = 0;
    cin >> N >> K >> C;
    vector<T> edge(K);
    for(auto &&[u, v, w, p] : edge){
        cin >> u >> v >> w >> p;
        u--, v--;
        swap(w, u);
    }
    sort(edge.begin(), edge.end());
    Kruskal_dsu<int> uf(N);
    vector<bool> used(N);
    for(auto &&[w, v, u, p] : edge){
        if(uf.merge(u, v, w)){
            used[id] = true;
            c += w;
            ans = max(ans, p);
        }
        id++;
    }
    if(c > C || uf.size() != 1){
        cout << -1 << '\n';
        return 0;
    }
    id = 0;
    for(auto &&[w, v, u, p] : edge){
        if(used[id++]) continue;
        if(c - uf.max_edge(u, v) + w <= C) ans = max(ans, p);
    }
    cout << ans << '\n';
}