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

struct edge {
  int to; i64 cost;
};

vector<vector<edge>> G0, rG;
vector<int> cost0, rcost;

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

  cost0.assign(n, 0);
  queue<int> que;
  que.push(0);
  while(!que.empty()) {
    int v = que.front(); que.pop();
    for(edge e : G0[v]) {
      if(cost0[e.to] < cost0[v] + e.cost) {
        cost0[e.to] = cost0[v] + e.cost;
        que.push(e.to);
      }
    }
  }

  rcost.assign(n, 0);
  que.push(n-1);
  while(!que.empty()) {
    int v = que.front(); que.pop();
    for(edge e : rG[v]) {
      if(rcost[e.to] < rcost[v] + e.cost) {
        rcost[e.to] = rcost[v] + e.cost;
        que.push(e.to);
      }
    }
  }
  int days = cost0[n-1];
  for(int i=0; i<n; ++i) { rcost[i] = days - rcost[i]; }

  int cnt = 0;
  for(int i=0; i<n; ++i) {
    if(cost0[i] != rcost[i]) { ++cnt; }
  }

  printf("%d %d/%d\n", days, cnt, n);

  return 0;
}