#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M;
int A[505050],B[505050],C[505050],W[505050];
vector<int> E[505050];
vector<int> F[505050];

int st[505050],ed[505050];

void solve() {
	int i,j,k,l,r,x,y; string s;
	cin>>N>>M;
	FOR(i,M) {
		cin>>A[i]>>B[i]>>C[i];
		E[A[i]].push_back(i);
		F[B[i]].push_back(i);
		W[B[i]]++;
	}
	queue<int> Q;
	FOR(i,N) if(W[i]==0) Q.push(i);
	while(Q.size()) {
		int k=Q.front();
		Q.pop();
		FORR(r,E[k]) {
			st[B[r]] = max(st[B[r]],st[k]+C[r]);
			W[B[r]]--;
			if(W[B[r]]==0) Q.push(B[r]);
		}
	}
	FOR(i,M) W[A[i]]++;
	FOR(i,N) {
		ed[i]=1<<30;
		if(W[i]==0) Q.push(i);
	}
	ed[N-1]=st[N-1];
	while(Q.size()) {
		int k=Q.front();
		Q.pop();
		FORR(r,F[k]) {
			ed[A[r]] = min(ed[A[r]],ed[k]-C[r]);
			W[A[r]]--;
			if(W[A[r]]==0) Q.push(A[r]);
		}
	}
	int ret=0;
	FOR(i,N) if(st[i]!=ed[i]) ret++;
	
	cout<<st[N-1]<<" "<<ret<<"/"<<N<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}