from collections import deque
def cycle_detectable_topological_sort(g, ind):
    V = len(g)
    order = []
    depth = [-1]*V
    for i in range(V):
        if not ind[i]:
            order.append(i)
            depth[i] = 0

    q = deque(order)
    while q:
        v = q.popleft()
        cur_depth = depth[v]
        for u in g[v]:
            ind[u] -= 1
            if not ind[u]:
                depth[u] = max(depth[u], cur_depth+1)
                q.append(u)
                order.append(u)
    if len(order) == V:
        return (order, depth)
    else:
        return (None, None)

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

INF = 10**18

n, m = map(int, input().split())
edge = [[] for i in range(n)]
rg = [[] for i in range(n)]
ind = [0]*n
for i in range(m):
    a, b, c = map(int, input().split())
    edge[a].append(b)
    rg[b].append((c, a))
    ind[b] += 1

order, _ = cycle_detectable_topological_sort(edge, ind)
dp1 = [-1]*n
dp1[0] = 0
for v in order:
    for c, u in rg[v]:
        dp1[v] = max(dp1[v], dp1[u]+c)
dp2 = [INF]*n
dp2[n-1] = dp1[n-1]
for v in reversed(order):
    for c, u in rg[v]:
        dp2[u] = min(dp2[u], dp2[v]-c)
#print(dp1)
#print(dp2)
ans = 0
for v in range(n):
    if dp1[v] != dp2[v]:
        ans += 1
print(dp1[v], str(ans)+'/'+str(n))