#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet};

mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;

    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn get<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().parse().unwrap()
    }

    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }

    #[allow(dead_code)]
    pub fn get2<T: FromStr, U: FromStr>() -> (T, U)
    where
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }

    #[allow(dead_code)]
    pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U)
    where
        <S as FromStr>::Err: Debug,
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
}

// std::cmp::Reverse doesn't have Clone.
#[derive(Eq, PartialEq, Clone)]
struct Rev<T>(pub T);

impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}

impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

#[allow(unused_macros)]
macro_rules! debug {
    ($x: expr) => {
        println!("{}: {:?}", stringify!($x), $x)
    }
}

fn dfs(
    i: usize,
    edges_rev: &Vec<Vec<(usize, usize)>>,
    memo: &mut HashMap<usize, usize>,
    path: &mut Vec<Vec<usize>>,
) -> usize {

    if let Some(&t) = memo.get(&i) {
        return t;
    }

    let l = edges_rev[i]
        .iter()
        .map(|&(a, c)| (dfs(a, edges_rev, memo, path) + c, a))
        .collect::<Vec<_>>();

    let longest = l.iter().map(|t| t.0).max().unwrap_or(0);

    for &(_, a) in l.iter().filter(|t| t.0 == longest) {
        path[i].push(a);
    }

    memo.insert(i, longest);
    longest
}

fn dfs2(i: usize, critical_edges: &Vec<Vec<usize>>, visited: &mut [bool]) {
    if visited[i] {
        return;
    }
    visited[i] = true;
    for &a in &critical_edges[i] {
        dfs2(a, critical_edges, visited);
    }
}

fn main() {
    let (n, m): (usize, usize) = util::get2();
    let abc: Vec<(usize, usize, usize)> = (0..m).map(|_| util::get3()).collect();

    let mut edges_rev = vec![Vec::new(); n];
    let mut critical_edges = vec![Vec::new(); n];
    let mut memo = HashMap::new();
    let mut visited = vec![false; n];

    for &(a, b, c) in &abc {
        edges_rev[b].push((a, c));
    }

    let t = dfs(n - 1, &edges_rev, &mut memo, &mut critical_edges);
    dfs2(n - 1, &critical_edges, &mut visited);
    println!("{} {}/{}", t, n - visited.iter().filter(|&&b| b).count(), n);
}