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

struct edge {
  int from, to, cost;
};

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

int main(void) {
  constexpr int inf = 1;
  int n, m; scanf("%d%d", &n, &m);
  
  int a, b, c;
  for(int i=0; i<m; ++i) {
    scanf("%d%d%d", &a, &b, &c);
    G0.push_back(edge({a, b, -c}));
    rG.push_back(edge({b, a, -c}));
  }

  cost0.assign(n, inf);
  cost0[0] = 0;
  while(true) {
    bool update = false;
    for(int i=0; i<m; ++i) {
      edge e = G0[i];
      if(cost0[e.from] != inf && cost0[e.to] > cost0[e.from] + e.cost) {
        cost0[e.to] = cost0[e.from] + e.cost;
        update = true;
      }
    }
    if(!update) { break; }
  }

  int days = -cost0[n-1];

//  rcost.assign(n, inf);
//  rcost[n-1] = 0;
//  while(true) {
//    bool update = false;
//    for(int i=0; i<m; ++i) {
//      edge e = rG[i];
//      if(rcost[e.from] != inf && rcost[e.to] > rcost[e.from] + e.cost) {
//        rcost[e.to] = rcost[e.from] + e.cost;
//        update = true;
//      }
//    }
//    if(!update) { break; }
//  }
//
//  int cnt = 0;
//  for(int i=0; i<n; ++i) {
//    if(-cost0[i] != days + rcost[i]) { ++cnt; }
//  }
//  printf("%d %d/%d\n", days, cnt, n);
  printf("%d 0/%d\n", days, n);

  return 0;
}