use std::collections::VecDeque;


const INF: usize = 1usize << 60;

fn main() {
    let mut nmk = String::new();
    std::io::stdin().read_line(&mut nmk).ok();
    let nmk: Vec<usize> = nmk.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nmk[0];
    let m = nmk[1];
    let k = nmk[2];
    let mut paths = vec![vec![]; n];
    for _ in 0..m {
        let mut uvc = String::new();
        std::io::stdin().read_line(&mut uvc).ok();
        let uvc: Vec<usize> = uvc.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let u = uvc[0]-1;
        let v = uvc[1]-1;
        let c = uvc[2];
        paths[u].push((v, c));
        paths[v].push((u, c));
    }

    let mut upper = INF;
    let mut lower = 0usize;
    while upper > lower {
        let middle = (upper + lower) / 2;
        let mut cnts = vec![INF; n];
        cnts[0] = 0;
        let mut deque = VecDeque::new();
        deque.push_back(0);
        while let Some(u) = deque.pop_front() {
            for &(v, c) in paths[u].iter() {
                let ncost = cnts[u] + if c > middle { 1 } else { 0 };
                if ncost >= cnts[v] { continue; }
                cnts[v] = ncost;
                if c > middle {
                    deque.push_back(v);
                } else {
                    deque.push_front(v);
                }
            }
        }
        if cnts[n-1] < k {
            upper = middle;
        } else {
            lower = middle + 1;
        }
    }
    println!("{}", upper);
}