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

struct edge {
  int to, cost;
};

int n, m;

vector<vector<bool>> prev2;
vector<bool> on_path;

void rec(int i) {
  if(i == 0) { on_path[i] = true; return; }
  if(on_path[i]) { return; }
  on_path[i] = true;
  for(int j=0; j<n; ++j) {
    if(prev2[i][j]) { rec(j); }
  }
}

int main(void) {
  scanf("%d%d", &n, &m);
  vector<vector<edge>> G(n, vector<edge>()); // G[n][]
  for(int i=0; i<m; ++i) {
    int a, b, c; scanf("%d%d%d", &a, &b, &c);
    G[a].push_back(edge({b, c}));
  }
  vector<int> cost(n, 0); // cost[n]
  prev2.assign(n, vector<bool>(n, false));
  queue<pair<int, int>> que;
  // コスト、点番号
  que.emplace(0, 0);
  while(!que.empty()) {
    int _, v; tie(_, v) = que.front(); que.pop();
    for(edge e : G[v]) {
      if(cost[e.to] < cost[v] + e.cost) {
        cost[e.to] = cost[v] + e.cost;
        que.emplace(cost[e.to], e.to);
        for(int i=0; i<n; ++i) { prev2[e.to][i] = false; }
        prev2[e.to][v] = true;
      } else if(cost[e.to] == cost[v] + e.cost) {
        prev2[e.to][v] = true;
      }
    }
  }
  int res = cost[n-1];
  on_path.assign(n, false);
  rec(n-1);
  int cnt = 0;
  for(int i=0; i<n; ++i) {
    if(!on_path[i]) { ++cnt; }
  }
  printf("%d %d/%d\n", res, cnt, n);
  return 0;
}