#![allow(clippy::many_single_char_names)]

use std::collections::VecDeque;
use std::io::Read as _;

macro_rules! chmin {
    ($xmin:expr, $x:expr) => {{
        if $x < $xmin {
            $xmin = $x;
            true
        } else {
            false
        }
    }};
}

fn solve(n: usize, graph: &[Vec<(usize, u32)>]) -> (u32, u32) {
    const W_MAX: u32 = 10_u32.pow(9) + 1;

    let mut ans_k = 0;

    let mut lo = 1;
    let mut hi = W_MAX;
    while lo + 1 < hi {
        let mid = (lo + hi) / 2;
        if let Some(k) = try_bfs(n, graph, mid) {
            ans_k = k;
            lo = mid;
        } else {
            hi = mid;
        }
    }

    (lo, ans_k)
}

fn try_bfs(n: usize, graph: &[Vec<(usize, u32)>], w: u32) -> Option<u32> {
    const INF: u32 = u32::MAX;

    let mut ks = vec![INF; n];
    let mut que = VecDeque::new();
    ks[0] = 0;
    que.push_back(0);

    while !que.is_empty() {
        let s = que.pop_front().unwrap();

        let k_new = ks[s] + 1;
        for &(t, d) in &graph[s] {
            if d < w {
                continue;
            }
            if chmin!(ks[t], k_new) {
                que.push_back(t);
            }
        }
    }

    let res = ks[n - 1];
    (res != INF).then(|| res)
}

fn main() {
    let mut input = String::new();
    std::io::stdin().read_to_string(&mut input).unwrap();

    let mut tokens = input.split_ascii_whitespace();
    macro_rules! read {
        ($ty:ty) => {{
            tokens.next().unwrap().parse::<$ty>().unwrap()
        }};
    }

    let n = read!(usize);
    let m = read!(usize);

    let mut graph: Vec<Vec<(usize, u32)>> = vec![vec![]; n];
    for _ in 0..m {
        let s = read!(usize) - 1;
        let t = read!(usize) - 1;
        let d = read!(u32);
        graph[s].push((t, d));
        graph[t].push((s, d));
    }

    let (ans_w, ans_k) = solve(n, &graph);

    println!("{} {}", ans_w, ans_k);
}