/* -*- coding: utf-8 -*-
 *
 * 468.cc: No.468 役に立つ競技プログラミング実践編 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int INF = 1 << 30;

/* typedef */

typedef queue<int> qi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

/* global variables */

vpii nbrs[MAX_N], prvs[MAX_N];
int dists0[MAX_N], dists1[MAX_N], pns[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    int ai, bi, ci;
    cin >> ai >> bi >> ci;
    nbrs[ai].push_back(pii(bi, ci));
    prvs[bi].push_back(pii(ai, ci));
  }

  qi q;
  q.push(0);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int &ud = dists0[u];

    vpii &nbru = nbrs[u];
    for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int &v = vit->first, vd = ud + vit->second;
      if (dists0[v] < vd) dists0[v] = vd;
      if (++pns[v] >= prvs[v].size()) q.push(v);
    }
  }

  for (int i = 0; i < n; i++) dists1[i] = INF, pns[i] = 0;
  dists1[n - 1] = dists0[n - 1];
  q.push(n - 1);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int &ud = dists1[u];

    vpii &prvu = prvs[u];
    for (vpii::iterator vit = prvu.begin(); vit != prvu.end(); vit++) {
      int &v = vit->first, vd = ud - vit->second;
      if (dists1[v] > vd) dists1[v] = vd;
      if (++pns[v] >= nbrs[v].size()) q.push(v);
    }
  }

  int cnt = 0;
  for (int i = 0; i < n; i++)
    if (dists0[i] != dists1[i]) cnt++;

  printf("%d %d/%d\n", dists0[n - 1], cnt, n);
  return 0;
}