#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, m, C[100005], CR[100005];
map<int, int> E[100005], R[100005];
map<int, int> DE[100005], DR[100005];
vi ts;
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, m){
    int a, b, c;
    cin >> a >> b >> c;
    E[a][b] = c;
    R[b][a] = c;
    DR[b][a] = c;
  }
  queue<int> q;
  q.push(0);
  while(!q.empty()){
    int t = q.front();
    q.pop();
    ts.pb(t);
    each(itr, E[t]){
      if(DR[itr->fi].size() == 1) q.push(itr->fi);
      DR[itr->fi].erase(t);
    }
  }
  each(itr, ts){
    int t = 0;
    each(itr2, R[*itr]) maxs(t, C[itr2->fi] + itr2->se);
    C[*itr] = t;
  }
  CR[n-1] = C[n-1];
  FORR(i, n-2, 0){
    int t = iinf;
    each(itr, E[ts[i]]) mins(t, CR[itr->fi] - itr->se);
    CR[ts[i]] = t;
  }
  int ans = 0;
  FOR(i, 0, n)if(C[i]==CR[i])ans++;
  cout << C[n-1] << " " << n-ans << "/" << n << endl;
  return 0;
}