from sys import stdin

class UnionFind():
    def __init__(self, n):
        self.parent_or_size = [-1] * n
        self.weight = [1 << 30] * n
    def leader(self, x):
        while self.parent_or_size[x] >= 0: x = self.parent_or_size[x]
        return x
    def merge(self, x, y, w):
        rx, ry = self.leader(x), self.leader(y)
        if rx == ry: return False
        if self.parent_or_size[rx] > self.parent_or_size[ry]: rx, ry = ry, rx
        self.parent_or_size[rx] += self.parent_or_size[ry]
        self.parent_or_size[ry] = rx
        self.weight[ry] = w
        return True
    def dist(self, x, y):
        ans = 0
        while x != y:
            if self.weight[x] > self.weight[y]: x, y = y, x
            ans = self.weight[x]
            x = self.parent_or_size[x]
        return ans

N, K, C = map(int, stdin.readline().split())
c, ans = 0, 0
uf = UnionFind(N)
E = [[] for _ in range(K)]
for i in range(K):
    u, v, w, p = map(int, stdin.readline().split())
    E[i] = [w, u - 1, v - 1, p]
E.sort()
for w, u, v, p in E:
    if uf.merge(u, v, w):
        c += w
        N -= 1
if N != 1 or c > C:
    print(-1)
    exit(0)
for w, u, v, p in E:
    if c - uf.dist(u, v) + w <= C: ans = max(ans, p)
print(ans)