# 体重決め打ちで二分探索、BFSでどうか

N, M = map(int, input().split())
edge_list = []
for i in range(M):
    s, t, d = map(int, input().split())
    edge_list.append((s, t, d))

from collections import deque
INF = 10**10

def BFS(weight):
    edges = [[] for i in range(N+1)]
    for s, t, d in edge_list:
        if d >= weight:
            edges[s].append(t)
            edges[t].append(s)
            
    que = deque()
    que.append(1)
    distance = [INF]*(N+1)
    distance[1] = 0
    while que:
        current = que.popleft()
        for nxt in edges[current]:
            if distance[nxt] > distance[current]+1:
                distance[nxt] = distance[current]+1
                que.append(nxt)
    #print(distance)
    return distance[N]
            
#for w in range(1, 5):
#    print(w, BFS(w))

OK = 0
NG = 10**9+1
while NG-OK>1:
    mid = (NG+OK)//2
    if BFS(mid) == INF:
        NG = mid
    else:
        OK = mid
print(OK, BFS(OK))