class unif: def __init__(self,n): self.pare=[-1]*n self.size=[1]*n def root(self,x): while self.pare[x]!=-1: x=self.pare[x] return x def unite(self,u,v): rootu=self.root(u) rootv=self.root(v) if rootu!=rootv: if self.size[rootu]>=self.size[rootv]: self.pare[rootv]=rootu self.size[rootu]+=self.size[rootv] else: self.pare[rootu]=rootv self.size[rootv]+=self.size[rootu] def same(self,s,t): return self.root(s)==self.root(t) import pypyjit pypyjit.set_param('max_unroll_recursion=-1') N,M,C=map(int,input().split()) G=[[] for i in range(N)] k=0 L=[] for i in range(M): a,b,w,p=map(int,input().split()) L.append((w,a-1,b-1,p)) L.sort() cost=0 R=[] Z=unif(N) result=0 for i in range(M): w,a,b,p=L[i][:] if Z.same(a,b)==False: k+=1 G[a].append((b,w)) G[b].append((a,w)) result=max(result,p) cost+=w Z.unite(a,b) else: R.append((w,a,b,p)) if k!=N-1: print(-1) exit() if cost>C: print(-1) exit() dist=[-1]*N dist[0]=0 from collections import deque S=deque() p=[[0]*N for i in range(20)] S.append(0) v=[[0]*N for i in range(20)] while S: x=S.popleft() for B in G[x]: y,w=B[:] if dist[y]>=0: continue dist[y]=dist[x]+1 S.append(y) p[0][y]=x v[0][y]=w for k in range(1,20): for i in range(N): p[k][i]=p[k-1][p[k-1][i]] v[k][i]=max(v[k-1][i],v[k-1][p[k-1][i]]) def LCA(x,y): a,b=x,y if dist[a]>k)&1: a=p[k][a] if a==b: return a for k in range(19,-1,-1): if p[k][a]!=p[k][b]: a=p[k][a] b=p[k][b] a=p[0][a] return a for B in R: w,a,b,f=B[:] d=0 z=LCA(a,b) e1=dist[a]-dist[z] e2=dist[b]-dist[z] pos=a for k in range(19,-1,-1): if (e1>>k)&1: d=max(d,v[k][pos]) pos=p[k][pos] pos=b for k in range(19,-1,-1): if (e2>>k)&1: d=max(d,v[k][pos]) pos=p[k][pos] cost2=cost-d+w if cost2<=C: result=max(result,f) print(result)