import sys
from collections import deque, defaultdict

input = sys.stdin.buffer.readline

def topological_sort(N, edges):
    outs = defaultdict(list)
    ins = defaultdict(int)
    for v1, v2, in edges:
        outs[v1].append(v2)
        ins[v2] += 1

    q = deque(v1 for v1 in range(N) if ins[v1] == 0)
    while q:
        v1 = q.popleft()
        yield v1
        for v2 in outs[v1]:
            ins[v2] -= 1
            if ins[v2] == 0:
                q.append(v2)


N, M = map(int, input().split())
edges = []
parents, children = [[] for _ in range(N)], [[] for _ in range(N)]
for _ in range(M):
    a, b, c = map(int, input().split())
    edges.append((a, b))
    parents[b].append((a, c))
    children[a].append((b, c))

tps = tuple(topological_sort(N, edges))
earliest, latest = [0] * N, [0] * N
for x in tps:
    earliest[x] = max((earliest[p] + v for p, v in parents[x]), default=0)
for x in reversed(tps):
    latest[x] = max((latest[c] + v for c, v in children[x]), default=0)

T = earliest[N - 1]
P = sum(earliest[x] + latest[x] != T for x in range(N))
print(f'{T} {P}/{N}')