#![allow(clippy::many_single_char_names)]

use std::cmp::Reverse;
use std::collections::BinaryHeap;
use std::io::Read as _;

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

fn solve(n: usize, graph: &[Vec<(usize, u32)>]) -> (u32, u32) {
    let mut bests = vec![(0, Reverse(u32::MAX)); n];
    let mut que = BinaryHeap::new();
    bests[0] = (u32::MAX, Reverse(0));
    que.push((u32::MAX, Reverse(0), 0));

    while !que.is_empty() {
        let (w, Reverse(k), s) = que.pop().unwrap();
        if (w, Reverse(k)) < bests[s] {
            continue;
        }
        dbg!((s, w, k));

        for &(t, d) in &graph[s] {
            let w_new = w.min(d);
            let k_new = k + 1;
            if chmax!(bests[t], (w_new, Reverse(k_new))) {
                que.push((w_new, Reverse(k_new), t));
            }
        }
    }

    let (ans_w, Reverse(ans_k)) = bests[n - 1];
    (ans_w, ans_k)
}

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);
}