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

class UnionFind{
    public:
    vector<int> par,siz;
 
    void make(int N){
        par.resize(N,-1);
        siz.resize(N,1);
    }
 
    int root(int x){
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
 
    void unite(int u, int v){
        u = root(u),v = root(v);
        if(u == v) return;
        if(siz.at(u) < siz.at(v)) swap(u,v);
 
        par.at(v) = u;
        siz.at(u) += siz.at(v);
    }
 
    bool issame(int u, int v){
        if(root(u) == root(v)) return true;
        else return false;
    }
};

class LowestCommonAncestor{
    public:
    vector<vector<int>> par,maxd;
    vector<int> dist;
    
    void make(vector<vector<pair<int,int>>> &Graph,int root){
        int N = Graph.size(),K = 1;
        while((1<<K) < N) K++;
        par.resize(K,vector<int>(N,-1));
        maxd.resize(K,vector<int>(N));
        dist.resize(N,-1);
        dfs(Graph,root,-1,0);
        for(int i=1; i<K; i++){
            for(int k=0; k<N; k++){
                if(par.at(i-1).at(k) == -1) par.at(i).at(k) = -1,maxd.at(i).at(k) = maxd.at(i-1).at(k);
                else{
                    par.at(i).at(k) = par.at(i-1).at(par.at(i-1).at(k));
                    maxd.at(i).at(k) = max(maxd.at(i-1).at(k),maxd.at(i-1).at(par.at(i-1).at(k)));
                }
            }
        }
    };

    void dfs(vector<vector<pair<int,int>>> &Graph,int pos,int back,int d){
        dist.at(pos) = d; par.at(0).at(pos) = back;
        for(auto [to,w] : Graph.at(pos)){
            if(to == back) continue;
            maxd.at(0).at(to) = w;
            dfs(Graph,to,pos,d+1);
        }
    }

    int LCA(int u,int v){
        int costu = 0,costv = 0;
        if(dist.at(u) < dist.at(v)) swap(u,v);
        int K = par.size(),diff = dist.at(u)-dist.at(v);
        for(int i=0; i<K; i++){
            if(!(diff&(1<<i))) continue;
            costu = max(costu,maxd.at(i).at(u));
            u = par.at(i).at(u); diff -= 1<<i;
        }
        if(u == v) return max(costu,costv);
        for(int i=K-1; i>=0; i--){
            if(par.at(i).at(u) == par.at(i).at(v)) continue;
            costu = max(costu,maxd.at(i).at(u)),costv = max(costv,maxd.at(i).at(v));
            u = par.at(i).at(u),v = par.at(i).at(v);
        }
        return max(costu,costv);
    }

    int twodist(int u,int v){
        int lca = LCA(u,v);
        return dist.at(u)+dist.at(v)-2*dist.at(lca);
    }
    int twodist2(int u,int v){
        return 0;
    }
};


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N,K,C; cin >> N >> K >> C;
    vector<tuple<int,int,int,int>> WPUV(K);
    for(auto &[w,p,u,v] : WPUV) cin >> u >> v >> w >> p,u--,v--;
    sort(WPUV.begin(),WPUV.end());

    int answer = 0;
    long long cost = 0;
    UnionFind UF; UF.make(N);
    vector<vector<pair<int,int>>> Graph(N);
    for(int i=0; i<N; i++){
        auto[w,p,u,v] = WPUV.at(i);
        if(UF.issame(u,v)) continue;
        UF.unite(u,v); cost += w;
        answer = max(answer,p);
        Graph.at(u).push_back({v,w});
        Graph.at(v).push_back({u,w});
    }
    if(cost > C){cout << -1 << endl; return 0;}
    
    LowestCommonAncestor Z; Z.make(Graph,0);
    for(int i=0; i<N; i++){
        auto[w,p,u,v] = WPUV.at(i);
        if(p <= answer) continue;
        int maxw = Z.LCA(u,v);
        if(cost+w-maxw <= C) answer = p; 
    }
    cout << answer << endl;
}