macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input! {
        n: usize,
        m: usize,
        edges: [(usize, usize, i32); m]
    }
    let mut gr = vec![vec![]; n];
    for i in 0..m {
        let (s, t, d) = edges[i];
        let s = s - 1;
        let t = t - 1;
        gr[s].push((t, d));
        gr[t].push((s, d));
    }

    let mut low = 0;
    let mut high = 1000_000_000;
    while high - low > 1 {
        let mid = (high + low) / 2;
        if bfs(&gr, mid) >= 0 {
            low = mid;
        } else {
            high = mid;
        }
    }
    println!("{} {}", low, bfs(&gr, low));
}

fn bfs(gr: &Vec<Vec<(usize, i32)>>, min_weight: i32) -> i32 {
    let n = gr.len();
    let mut d = vec![None; n];
    let mut que = std::collections::VecDeque::new();
    d[0] = Some(0);
    que.push_back(0);
    while !que.is_empty() {
        let v = que.pop_front().unwrap();
        for &(nv, c) in &gr[v] {
            if c >= min_weight && d[nv].is_none() {
                d[nv] = Some(d[v].unwrap() + 1);
                que.push_back(nv);
            }
        }
    }
    return if d[n - 1].is_none() {
        -1
    } else {
        d[n - 1].unwrap()
    };
}