import sys
sys.setrecursionlimit(100010)

def root(x):
    if P[x] < 0:
        return x
    else:
        P[x] = root(P[x])  # 経路圧縮
        return P[x]

def unite(x, y):
    x = root(x)
    y = root(y)
    if x == y: return
    P[x] += P[y]
    P[y] = x

def same(x, y):
    return root(x) == root(y)

n, m = map(int, input().split())
STD = [list(map(int, input().split())) for _ in range(m)]
STD.sort(key=lambda x: (-x[2]))
P = [-1] * (n + 1)
E = [[] for _ in range(n + 1)]
nowd = 10 ** 10
flag = 1
for i, (s, t, d) in enumerate(STD):
    if flag == 1:
        if nowd > d:
            nowd = d
        unite(s, t)
        E[s].append(t)
        E[t].append(s)
        if same(1, n):
            flag = 0
    else:
        if d != nowd:
            break
        else:
            unite(s, t)
            E[s].append(t)
            E[t].append(s)

print(E)
from collections import deque

q1 = deque()
cnt = 0
q1.append(1)
visited = [0] * (n + 1)
visited[1] = 1
while len(q1) > 0:
    cnt += 1
    q2 = deque()
    while len(q1) > 0:
        p = q1.pop()
        for x in E[p]:
            if x == n:
                print(nowd, cnt)
                exit()
            if visited[x] == 0:
                visited[x] = 1
                q2.append(x)
    q1 = q2