import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10^^9;

int N, M;
int[] A, B, C;

int[][] G, H;
int[] d0, d1;

int calc0(int u) {
  if (d0[u] == -1) {
    d0[u] = 0;
    foreach (i; H[u]) {
      chmax(d0[u], calc0(A[i]) + C[i]);
    }
  }
  return d0[u];
}

int calc1(int u) {
  if (d1[u] == -1) {
    d1[u] = (u == N - 1) ? d0[u] : INF;
    foreach (i; G[u]) {
      chmin(d1[u], calc1(B[i]) - C[i]);
    }
  }
  return d1[u];
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      A = new int[M];
      B = new int[M];
      C = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
        B[i] = readInt();
        C[i] = readInt();
      }
      
      G = new int[][N];
      H = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        H[B[i]] ~= i;
      }
      
      d0 = new int[N];
      d0[] = -1;
      foreach (u; 0 .. N) {
        calc0(u);
      }
      d1 = new int[N];
      d1[] = -1;
      foreach (u; 0 .. N) {
        calc1(u);
      }
      debug {
        writeln("d0 = ", d0);
        writeln("d1 = ", d1);
      }
      
      auto cr = new bool[N];
      foreach (i; 0 .. M) {
        if (d0[A[i]] == d1[A[i]] && d0[B[i]] == d1[B[i]]) {
          cr[A[i]] = cr[B[i]] = true;
        }
      }
      writefln("%s %s/%s", d0[N - 1], cr.count(false), N);
    }
  } catch (EOFException e) {
  }
}