#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
	int n, k;
	ll c;
	cin >> n >> k >> c;
	vector<int> u(k), v(k), w(k), p(k);
	rep(i,k) {
		cin >> u[i] >> v[i] >> w[i] >> p[i];
		--u[i];--v[i];
	} 
	vector<int> vs, ps;
	rep(i,k) vs.push_back(i);
	rep(i,k) ps.push_back(i);
	sort(vs.begin(),vs.end(),[&](int l, int r) {
		return w[l]<w[r];
	});
	sort(ps.begin(),ps.end(),[&](int l, int r) {
		return p[l]<p[r];
	});
	int low = 0;
	int high = n;
	{
		ll sum = 0;
		dsu uf(n);
		rep(i,k){
			if(uf.same(u[vs[i]], v[vs[i]])) continue;
			uf.merge(u[vs[i]], v[vs[i]]);
			sum += w[vs[i]];
		}
		if(sum>c){
			cout<<-1<<endl;
			return 0;
		}
	}
	while(high-low>1){
		int mid = (high+low)/2;
		dsu uf(n);
		uf.merge(u[ps[mid]], v[ps[mid]]);
		ll sum = w[ps[mid]];
		rep(i,k){
			if(uf.same(u[vs[i]], v[vs[i]])) continue;
			uf.merge(u[vs[i]], v[vs[i]]);
			sum += w[vs[i]];
		}
		if(sum<=c) low = mid;
		else high = mid;
	}
	cout << p[ps[low]] << endl;
	return 0;
}