#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;
vector<pii> g[125252];
int mxd[125252];
int mnd[125252];

int main(){
  scanf("%d%d",&n,&m);
  REP(i,m){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    g[a].push_back(pii(b,c));
  }
  REP(i,n)mxd[i]=-1, mnd[i]=1e9;
  mxd[0] = mnd[0] = 0;
  priority_queue<pii> Q;
  Q.push(pii(-0,0));
  while(Q.size()){
    pii P = Q.top(); Q.pop();
    int p = P.second;
    if(mnd[p]!=-P.first)continue;
    for(pii S:g[p]){
      int to = S.first;
      int nxtd = mxd[p]+S.second;
      if(mnd[to]>nxtd){
        mnd[to] = nxtd;
        Q.push(pii(-nxtd,to));
      }
      CHMAX(mxd[to],nxtd);
    }
  }
  int ans = n;
  REP(i,n)if(mnd[i]==mxd[i])ans--;
  printf("%d %d/%d\n",mxd[n-1],ans,n);
  return 0;
}