from collections import defaultdict, deque

n, m = map(int, input().split())
edge = defaultdict(list)
for _ in range(m):
    s, t, d = map(int, input().split())
    edge[s].append((t, d))
    edge[t].append((s, d))

left, right = 1, 10**9 + 1
ans = -1
while right - left > 1:
    mid = (left + right) // 2
    flag = False
    Que = deque([1])
    C = [10**18 for _ in range(n + 1)]
    C[1] = 0
    while Que:
        cp = Que.popleft()
        if cp == n:
            flag = True
            ans = C[cp]
            break
        cnt = C[cp]
        for np, w in edge[cp]:
            if w < mid:
                continue
            if cnt + 1 > C[np]:
                continue
            C[np] = cnt + 1
            Que.append(np)
    if flag:
        left = mid
    else:
        right = mid
print(left, ans)