#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 9;
const LL LLINF = 1e18;

int N, M;
VT<VPII> g, grev;
VI v, vrev;

template<typename ctype = less<int>,
typename ctype2 = less<PII>>
int search(VT<VPII> &graph, VI &score, int st) {
	ctype comp;
	VT<bool> used(N, false);
	priority_queue<PII, VPII, ctype2> pq;
	pq.push(MP(0, st));
	score[st] = 0;
	while (!pq.empty()) {
		int nowscore, nowpoint;
		tie(nowscore, nowpoint) = pq.top(); pq.pop();
		if (used[nowpoint]) continue;
		used[nowpoint] = true;
		FORE(e, graph[nowpoint]) {
			int nextscore = nowscore + e.second;
			if (max(score[e.first], nextscore, comp) == score[e.first]) {
				continue;
			}
			score[e.first] = nextscore;
			pq.push(MP(nextscore, e.first));
		}
	}
	//FORE(e, score) cout << e << " ";cout << endl;
	return score[N - 1];
}

template<typename ctype = less<int>,
typename ctype2 = less<PII>>
int search2(const VT<VPII> &graph,VI &memoScore, const VI &score, int st) {
	ctype comp;
	VT<bool> used(N, false);
	priority_queue<PII, VPII, ctype2> pq;
	pq.push(MP(score[st], st));
	memoScore[st] = score[st];
	while (!pq.empty()) {
		int nowscore, nowpoint;
		tie(nowscore, nowpoint) = pq.top(); pq.pop();
		if (used[nowpoint]) continue;
		used[nowpoint] = true;
		FORE(e, graph[nowpoint]) {
			int nextscore = nowscore + e.second;

			memoScore[e.first] = nextscore;
			pq.push(MP(score[e.first], e.first));
		}
	}
	//FORE(e, memoScore) cout << e << " ";cout << endl;
	return score[N - 1];
}

int main(void) {
	scanf("%d%d", &N, &M);
	g.resize(N);
	v.resize(N, 0);
	grev.resize(N);
	vrev.resize(N, INF);
	REP(i, M) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		g[a].EB(MP(b, c));
		grev[b].EB(MP(a, -c));
	}
	int n = search<less<int>, less<PII>>(g, v, 0);
	search2<greater<int>, greater<PII>>(grev, vrev, v, N - 1);
	int cnt = 0;
	REP(i, N) {
		cnt += v[i] != vrev[i];
	}
	cout << n << " " << cnt << "/" << N << endl;
	return 0;
}