#include <iostream>
#include <vector>
#include <queue>
using namespace std;

class TopologicalSort{
	private:
		int n;
		vector<vector<int>> g;
		vector<int> p;

	public:
		TopologicalSort():TopologicalSort(0){}
		TopologicalSort(int _n):
			n(_n), g(_n){}

		void add_edge(int u, int v){
			g[u].push_back(v);
		}

		bool build(){
			vector<int> cnt(n);
			for(int v=0; v<n; v++){
				for(int nv:g[v]){
					cnt[nv]++;
				}
			}
			queue<int> que;
			for(int v=0; v<n; v++){
				if(cnt[v]==0){
					que.push(v);
				}
			}
			while(!que.empty()){
				int v = que.front();
				que.pop();
				p.push_back(v);
				for(int nv:g[v]){
					cnt[nv]--;
					if(cnt[nv]==0){
						que.push(nv);
					}
				}
			}
			if(n!=int(p.size())){
				p.clear();
				return false;
			}
			return true;
		}

		int operator[](const int i) const {
			return p[i];
		}
};

int main(){
	int N, M;
	cin >> N >> M;
	vector<vector<pair<int,int>>> g(N);
	TopologicalSort tp(N), tp_inv(N);
	for(int i=0; i<M; i++){
		int u, v, w;
		cin >> u >> v >> w;
		g[u].push_back(make_pair(v,w));
		tp.add_edge(u, v);
		tp_inv.add_edge(v, u);
	}

	tp.build();
	tp_inv.build();

	vector<int> dp(N,0), ep(N,1<<30);
	dp[0] = ep[0] = 0;

	for(int i=0; i<N; i++){
		int v = tp[i];
		for(auto [nv,co]:g[v]){
			dp[nv] = max(dp[nv], dp[v]+co);
		}
	}

	ep[N-1] = dp[N-1];

	for(int i=0; i<N; i++){
		int v = tp_inv[i];
		for(auto [nv,co]:g[v]){
			ep[v] = min(ep[v], ep[nv]-co);
		}
	}

	int cnt = N;
	for(int i=0; i<N; i++){
		if(dp[i]==ep[i]){
			cnt--;
		}
	}

	cout << dp[N-1] << ' ' << cnt << '/' << N << endl;
}