import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# {.checks: off.}
ImportExpand "cplib/tmpl/citrus.nim" <=== "when not declared CPLIB_TMPL_CITRUS:\n    const CPLIB_TMPL_CITRUS* = 1\n    {.warning[UnusedImport]: off.}\n    {.hint[XDeclaredButNotUsed]: off.}\n    import os\n    import algorithm\n    import sequtils\n    import tables\n    import macros\n    import std/math\n    import sets\n    import strutils\n    import strformat\n    import sugar\n    import streams\n    import deques\n    import bitops\n    import heapqueue\n    import options\n    import hashes\n    const MODINT998244353* = 998244353\n    const MODINT1000000007* = 1000000007\n    const INF* = 100100111\n    const INFL* = int(3300300300300300491)\n    type double* = float64\n    let readNext = iterator(getsChar: bool = false): string {.closure.} =\n        while true:\n            var si: string\n            try: si = stdin.readLine\n            except EOFError: yield \"\"\n            for s in si.split:\n                if getsChar:\n                    for i in 0..<s.len():\n                        yield s[i..i]\n                else:\n                    if s.isEmptyOrWhitespace: continue\n                    yield s\n    proc input*(t: typedesc[string]): string = readNext()\n    proc input*(t: typedesc[char]): char = readNext(true)[0]\n    proc input*(t: typedesc[int]): int = readNext().parseInt\n    proc input*(t: typedesc[float]): float = readNext().parseFloat\n    macro input*(t: typedesc, n: varargs[int]): untyped =\n        var repStr = \"\"\n        for arg in n:\n            repStr &= &\"({arg.repr}).newSeqWith \"\n        parseExpr(&\"{repStr}input({t})\")\n    macro input*(ts: varargs[auto]): untyped =\n        var tupStr = \"\"\n        for t in ts:\n            tupStr &= &\"input({t.repr}),\"\n        parseExpr(&\"({tupStr})\")\n    macro input*(n: int, ts: varargs[auto]): untyped =\n        for typ in ts:\n            if typ.typeKind != ntyAnything:\n                error(\"Expected typedesc, got \" & typ.repr, typ)\n        parseExpr(&\"({n.repr}).newSeqWith input({ts.repr})\")\n    proc `fmtprint`*(x: int or string or char or bool): string = return $x\n    proc `fmtprint`*(x: float or float32 or float64): string = return &\"{x:.16f}\"\n    proc `fmtprint`*[T](x: seq[T] or Deque[T] or HashSet[T] or set[T]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T, N](x: array[T, N]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T](x: HeapQueue[T]): string =\n        var q = x\n        while q.len != 0:\n            result &= &\"{q.pop()}\"\n            if q.len != 0: result &= \" \"\n    proc `fmtprint`*[T](x: CountTable[T]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc `fmtprint`*[K, V](x: Table[K, V]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `fmtprint`]) =\n        for i in 0..<len(args):\n            prop.f.write(&\"{args[i]}\")\n            if i != len(args) - 1: prop.f.write(prop.sepc) else: prop.f.write(prop.endc)\n        if prop.flush: prop.f.flushFile()\n    proc print*(args: varargs[string, `fmtprint`]) = print((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n    const LOCAL_DEBUG{.booldefine.} = false\n    macro getSymbolName(x: typed): string = x.toStrLit\n    macro debug*(args: varargs[untyped]): untyped =\n        when LOCAL_DEBUG:\n            result = newNimNode(nnkStmtList, args)\n            template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n            for i, arg in args:\n                if arg.kind == nnkStrLit:\n                    result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n                else:\n                    result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n                    result.add(quote do: print(prop(), `arg`))\n                if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n                else: result.add(quote do: print(prop(), \"\\n\"))\n        else:\n            return (quote do: discard)\n    proc `%`*(x: SomeInteger, y: SomeInteger): int =\n        result = x mod y\n        if y > 0 and result < 0: result += y\n        if y < 0 and result > 0: result += y\n    proc `//`*(x: SomeInteger, y: SomeInteger): int =\n        result = x div y\n        if y > 0 and result * y > x: result -= 1\n        if y < 0 and result * y < x: result -= 1\n    proc `^`*(x: SomeInteger, y: SomeInteger): int = x xor y\n    proc `&`*(x: SomeInteger, y: SomeInteger): int = x and y\n    proc `|`*(x: SomeInteger, y: SomeInteger): int = x or y\n    proc `>>`*(x: SomeInteger, y: SomeInteger): int = x shr y\n    proc `<<`*(x: SomeInteger, y: SomeInteger): int = x shl y\n    proc `%=`*(x: var SomeInteger, y: SomeInteger): void = x = x % y\n    proc `//=`*(x: var SomeInteger, y: SomeInteger): void = x = x // y\n    proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n    proc `&=`*(x: var SomeInteger, y: SomeInteger): void = x = x & y\n    proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n    proc `>>=`*(x: var SomeInteger, y: SomeInteger): void = x = x >> y\n    proc `<<=`*(x: var SomeInteger, y: SomeInteger): void = x = x << y\n    proc `[]`*(x, n: int): bool = (x and (1 shl n)) != 0\n    proc `[]=`*(x: var int, n: int, i: bool) =\n        if i: x = x or (1 << n)\n        else: (if x[n]: x = x xor (1 << n))\n    proc pow*(a, n: int, m = INFL): int =\n        var\n            rev = 1\n            a = a\n            n = n\n        while n > 0:\n            if n % 2 != 0: rev = (rev * a) mod m\n            if n > 1: a = (a * a) mod m\n            n >>= 1\n        return rev\n    #[ include cplib/math/isqrt ]#\n    when not declared CPLIB_MATH_ISQRT:\n        const CPLIB_MATH_ISQRT* = 1\n        proc isqrt*(n: int): int =\n            var x = n\n            var y = (x + 1) shr 1\n            while y < x:\n                x = y\n                y = (x + n div x) shr 1\n            return x\n    proc chmax*[T](x: var T, y: T): bool {.discardable.} = (if x < y: (x = y; return true; ) return false)\n    proc chmin*[T](x: var T, y: T): bool {.discardable.} = (if x > y: (x = y; return true; ) return false)\n    proc `max=`*[T](x: var T, y: T) = x = max(x, y)\n    proc `min=`*[T](x: var T, y: T) = x = min(x, y)\n    proc at*(x: char, a = '0'): int = int(x) - int(a)\n    converter tofloat*(n: int): float = float(n)\n    proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n    proc No*(b: bool = true): void = Yes(not b)\n    proc YES_upper*(b: bool = true): void = print(if b: \"YES\" else: \"NO\")\n    proc NO_upper*(b: bool = true): void = Yes_upper(not b)\n    const DXY* = [(0, -1), (0, 1), (-1, 0), (1, 0)]\n    const DDXY* = [(1, -1), (1, 0), (1, 1), (0, -1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]\n    macro exit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n"
ImportExpand "cplib/collections/segtree.nim" <=== "when not declared CPLIB_COLLECTIONS_SEGTREE:\n    const CPLIB_COLLECTIONS_SEGTREE* = 1\n    import algorithm\n    type SegmentTree*[T] = ref object\n        default: T\n        merge: proc(x: T, y: T): T\n        arr*: seq[T]\n        lastnode: int\n        length: int\n    proc initSegmentTree*[T](v: seq[T], merge: proc(x: T, y: T): T, default: T): SegmentTree[T] =\n        ## セグメントツリーを生成します。\n        ## vに元となるリスト、mergeに二つの区間をマージする関数、デフォルトに単位元を与えてください。\n        var lastnode = 1\n        while lastnode < len(v):\n            lastnode*=2\n        var arr = newSeq[T](2*lastnode)\n        arr.fill(default)\n        var self = SegmentTree[T](default: default, merge: merge, arr: arr, lastnode: lastnode, length: len(v))\n        #1-indexedで作成する\n        for i in 0..<len(v):\n            self.arr[self.lastnode+i] = v[i]\n        for i in countdown(lastnode-1, 1):\n            self.arr[i] = self.merge(self.arr[2*i], self.arr[2*i+1])\n        return self\n\n    proc update*[T](self: SegmentTree[T], x: Natural, val: T) =\n        ## xの要素をvalに変更します。\n        assert x < self.length\n        var x = x\n        x += self.lastnode\n        self.arr[x] = val\n        while x > 1:\n            x = x shr 1\n            self.arr[x] = self.merge(self.arr[2*x], self.arr[2*x+1])\n    proc get*[T](self: SegmentTree[T], q_left: Natural, q_right: Natural): T =\n        ## 半解区間[q_left,q_right)についての演算結果を返します。\n        assert q_left <= q_right and 0 <= q_left and q_right <= self.length\n        var q_left = q_left\n        var q_right = q_right\n        q_left += self.lastnode\n        q_right += self.lastnode\n        var (lres, rres) = (self.default, self.default)\n        while q_left < q_right:\n            if (q_left and 1) > 0:\n                lres = self.merge(lres, self.arr[q_left])\n                q_left += 1\n            if (q_right and 1) > 0:\n                q_right -= 1\n                rres = self.merge(self.arr[q_right], rres)\n            q_left = q_left shr 1\n            q_right = q_right shr 1\n        return self.merge(lres, rres)\n    proc get*[T](self: SegmentTree[T], segment: HSlice[int, int]): T =\n        assert segment.a <= segment.b + 1 and 0 <= segment.a and segment.b+1 <= self.length\n        return self.get(segment.a, segment.b+1)\n    proc `[]`*[T](self: SegmentTree[T], index: Natural): T =\n        assert index < self.length\n        return self.arr[index+self.lastnode]\n    proc `[]=`*[T](self: SegmentTree[T], index: Natural, val: T) =\n        assert index < self.length\n        self.update(index, val)\n    proc get_all*[T](self: SegmentTree[T]): T =\n        ## [0,len(self))区間の演算結果をO(1)で返す\n        return self.arr[1]\n    proc len*[T](self: SegmentTree[T]): int =\n        return self.length\n\n    template newSegWith*(V, merge, default: untyped): untyped =\n        initSegmentTree(V, (l, r{.inject.}: typeof(default)) => merge, default)\n\n"
ImportExpand "cplib/collections/unionfind.nim" <=== "when not declared CPLIB_COLLECTIONS_UNIONFIND:\n    const CPLIB_COLLECTIONS_UNIONFIND* = 1\n    import algorithm\n    import sequtils\n    type UnionFind = ref object\n        count*: int\n        par_or_siz: seq[int]\n    proc initUnionFind*(N: int): UnionFind =\n        result = UnionFind(count: N, par_or_siz: newSeqwith(N, -1))\n    proc root*(self: UnionFind, x: int): int =\n        if self.par_or_siz[x] < 0:\n            return x\n        else:\n            self.par_or_siz[x] = self.root(self.par_or_siz[x])\n            return self.par_or_siz[x]\n    proc issame*(self: UnionFind, x: int, y: int): bool =\n        return self.root(x) == self.root(y)\n    proc unite*(self: UnionFind, x: int, y: int) =\n        var x = self.root(x)\n        var y = self.root(y)\n        if(x != y):\n            if(self.par_or_siz[x] > self.par_or_siz[y]):\n                swap(x, y)\n            self.par_or_siz[x] += self.par_or_siz[y]\n            self.par_or_siz[y] = x\n            self.count -= 1\n    proc siz*(self: UnionFind, x: int): int =\n        var x = self.root(x)\n        return -self.par_or_siz[x]\n"

# https://atcoder.jp/contests/abc337/submissions/50216964
# ↑上記の提出より引用

type HeavyLightDecomposition = ref object
    N: int
    P: seq[int]
    PP: seq[int]
    PD: seq[int]
    D: seq[int]
    I: seq[int]
    rangeL: seq[int]
    rangeR: seq[int]

proc initHld(hld: HeavyLightDecomposition, adj: seq[seq[int]], root: int) =
    var n: int = len(adj)
    hld.N = n
    hld.P = newSeqWith(n, -1)
    hld.I = newSeqWith(n, 0)
    hld.I[0] = root
    var iI: int = 1
    for i in 0..<n:
        var p = hld.I[i]
        for e in adj[p]:
            if hld.P[p] != e:
                hld.I[iI] = e
                hld.P[e] = p
                iI += 1
    var Z = newSeqWith(n, 1)
    var nx = newSeqWith(n, -1)
    hld.PP = newSeqWith(n, 0)
    for i in 0..<n:
        hld.PP[i] = i
    for i in 1..<n:
        var p = hld.I[n-i]
        Z[hld.P[p]] += Z[p]
        if nx[hld.P[p]] == -1 or Z[nx[hld.P[p]]] < Z[p]:
            nx[hld.P[p]] = p
    for p in hld.I:
        if nx[p] != -1:
            hld.PP[nx[p]] = p
    hld.PD = newSeqWith(n, n)
    hld.PD[root] = 0
    hld.D = newSeqWith(n, 0)
    for p in hld.I:
        if p != root:
            hld.PP[p] = hld.PP[hld.PP[p]]
            hld.PD[p] = min(hld.PD[hld.PP[p]], hld.PD[hld.P[p]]+1)
            hld.D[p] = hld.D[hld.P[p]]+1
    hld.rangeL = newSeqWith(n, 0)
    hld.rangeR = newSeqWith(n, 0)
    for p in hld.I:
        hld.rangeR[p] = hld.rangeL[p] + Z[p]
        var ir = hld.rangeR[p]
        for e in adj[p]:
            if hld.P[p] != e and e != nx[p]:
                ir -= Z[e]
                hld.rangeL[e] = ir
        if nx[p] != -1:
            hld.rangeL[nx[p]] = hld.rangeL[p] + 1
    for i in 0..<n:
        hld.I[hld.rangeL[i]] = i

proc numVertices(hld: HeavyLightDecomposition): int = hld.N
proc depth(hld: HeavyLightDecomposition, p: int): int = hld.D[p]
proc toSeq(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeL[vtx]
proc toVtx(hld: HeavyLightDecomposition, seqidx: int): int = hld.I[seqidx]
proc toSeq2In(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeL[vtx] * 2 - hld.D[vtx]
proc toSeq2Out(hld: HeavyLightDecomposition, vtx: int): int = hld.rangeR[vtx] * 2 - hld.D[vtx] - 1
proc parentOf(hld: HeavyLightDecomposition, v: int): int = hld.P[v]
proc heavyRootOf(hld: HeavyLightDecomposition, v: int): int = hld.PP[v]
proc heavyChildOf(hld: HeavyLightDecomposition, v: int): int =
    if hld.toSeq(v) == hld.N-1:
        return -1
    var cand = hld.toVtx(hld.toSeq(v) + 1)
    if hld.PP[v] == hld.PP[cand]:
        return cand
    -1
proc lca(hld: HeavyLightDecomposition, u: int, v: int): int =
    var (u, v) = (u, v)
    if hld.PD[u] < hld.PD[v]:
        swap(u, v)
    while hld.PD[u] > hld.PD[v]:
        u = hld.P[hld.PP[u]]
    while hld.PP[u] != hld.PP[v]:
        u = hld.P[hld.PP[u]]
        v = hld.P[hld.PP[v]]
    if hld.D[u] > hld.D[v]:
        return v
    u
proc dist(hld: HeavyLightDecomposition, u: int, v: int): int =
    hld.depth(u) + hld.depth(v) - hld.depth(hld.lca(u, v)) * 2
proc path(hld: HeavyLightDecomposition, r: int, c: int, include_root: bool, reverse_path: bool): seq[(int, int)] =
    var (r, c) = (r, c)
    var k = hld.PD[c] - hld.PD[r] + 1
    if k <= 0:
        return @[]
    var res = newSeqWith(k, (0, 0))
    for i in 0..<k-1:
        res[i] = (hld.rangeL[hld.PP[c]], hld.rangeL[c] + 1)
        c = hld.P[hld.PP[c]]
    if hld.PP[r] != hld.PP[c] or hld.D[r] > hld.D[c]:
        return @[]
    var root_off: int = 0
    if include_root:
        root_off = 1
    res[^1] = (hld.rangeL[r]+root_off, hld.rangeL[c]+1)
    if res[^1][0] == res[^1][1]:
        discard res.pop()
        k -= 1
    if reverse_path:
        for i in 0..<k:
            res[i] = (hld.N - res[i][1], hld.N - res[i][0])
    else:
        res.reverse()
    res
proc subtree(hld: HeavyLightDecomposition, p: int): (int, int) = (hld.rangeL[p], hld.rangeR[p])
proc median(hld: HeavyLightDecomposition, x: int, y: int, z: int): int =
    hld.lca(x, y) xor hld.lca(y, z) xor hld.lca(x, z)
proc la(hld: HeavyLightDecomposition, starting: int, goal: int, d: int): int =
    var (u, v, d) = (starting, goal, d)
    if d < 0:
        return -1
    var g = hld.lca(u, v)
    var dist0 = hld.D[u] - hld.D[g]*2 + hld.D[v]
    if dist0 < d:
        return -1
    var p = u
    if hld.D[u] - hld.D[g] < d:
        p = v
        d = dist0 - d
    while hld.D[p] - hld.D[hld.PP[p]] < d:
        d -= hld.D[p] - hld.D[hld.PP[p]] + 1
        p = hld.P[hld.PP[p]]
    hld.I[hld.rangeL[p] - d]
iterator children(hld: HeavyLightDecomposition, v: int): int =
    var s = hld.rangeL[v] + 1
    while s < hld.rangeR[v]:
        var w = hld.toVtx(s)
        yield w
        s += hld.rangeR[w] - hld.rangeL[w]

#引用　ここまで

var n, m, c = input(int)
var g = newSeqWith(n, newSeq[int](0))
var uf = initUnionFind(n)
var ans = 0
var wpuv = newSeq[(int, int, int, int)](0)
for i in 0..<m:
    var u, v = input(int) - 1
    var w, p = input(int)
    wpuv.add((w, p, u, v))
wpuv.sort
var e = initTable[(int, int), int]()
for (w, p, u, v) in wpuv:
    if uf.issame(u, v): continue
    ans.max = p
    c -= w
    uf.unite(u, v)
    g[u].add(v)
    g[v].add(u)
    e[(u, v)] = w
    e[(v, u)] = w

if uf.count != 1 or c < 0: exit(print(-1))
var hld = new HeavyLightDecomposition
hld.initHld(g, 0)
var seg = newSegWith(newSeqWith(n, 0), max(l, r), -INFL)
for i in 1..<n:
    var c = e[(hld.P[i], i)]
    debug(i, c)
    seg[hld.toSeq(i)] = c

for (w, p, u, v) in wpuv:
    var mn = INFL
    for (l, r) in hld.path(hld.lca(u, v), u, true, false): mn.min = seg.get(l..<r)
    for (l, r) in hld.path(hld.lca(u, v), v, true, true): mn.min = seg.get(l..<r)
    if c + mn - w >= 0: ans.max= p
print(ans)