#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

constexpr i64 inf = 987654321987654321LL;

struct edge { int to; i64 cost; };

vector<vector<edge>> fG, rG;
vector<i64> dp0, dp1;

i64 rec0(int v) {
  i64 &res = dp0[v];
  if(res != -1) { return res; }
  res = 0;
  for(edge &e : rG[v]) {
    res = max(res, rec0(e.to) + e.cost);
  }
  return res;
}

i64 rec1(int v) {
  i64 &res = dp1[v];
  if(res != -1) { return res; }
  res = inf;
  for(edge &e : fG[v]) {
    res = min(res, rec1(e.to) - e.cost);
  }
  return res;
}

int main(void) {
  int n, m; scanf("%d%d", &n, &m);
  fG.assign(n, vector<edge>());
  rG.assign(n, vector<edge>());
  for(int i=0; i<m; ++i) {
    int a, b; i64 c; scanf("%d%d%lld", &a, &b, &c);
    fG[a].push_back(edge({b, c}));
    rG[b].push_back(edge({a, c}));
  }
  dp0.assign(n, -1);
  rec0(n-1);
  dp1.assign(n, -1);
  i64 days = dp0[n-1];
  dp1[n-1] = days;
  rec1(0);

  int cnt = 0;
  for(int i=0; i<n; ++i) { cnt += dp0[i] != dp1[i]; }
  printf("%lld %d/%d\n", days, cnt, n);
  return 0;
}