from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n,m=MI()
    to=[[] for _ in range(n)]
    ot=[[] for _ in range(n)]
    for _ in range(m):
        u,v,c=MI()
        to[u].append((v,c))
        ot[v].append((u,c))

    # 最早結合点時刻
    q=deque()
    deg=[0]*n
    fast=[0]*n
    q.append(0)
    while q:
        u=q.popleft()
        for v,c in to[u]:
            deg[v]+=1
            if fast[u]+c>fast[v]:fast[v]=fast[u]+c
            if deg[v]==len(ot[v]):q.append(v)
    #print(fast)

    # 最遅結合点時刻
    q=deque()
    deg=[0]*n
    slow=[fast[n-1]]*n
    q.append(n-1)
    while q:
        u=q.popleft()
        for v,c in ot[u]:
            deg[v]+=1
            if slow[u]-c<slow[v]:slow[v]=slow[u]-c
            if deg[v]==len(to[v]):q.append(v)
    #print(slow)
    p=sum(fast[u]!=slow[u] for u in range(n))
    print("{} {}/{}".format(fast[n-1],p,n))

main()