N,M = map(int,input().split())
std = [tuple(map(int,input().split())) for _ in range(M)]
dst = [(d,s-1,t-1) for (s,t,d) in std]
dst.sort()
from collections import defaultdict,deque
import sys
sys.setrecursionlimit(10**6)
v = deque()
def is_ok(x):
    e = defaultdict(list)
    for i in range(M-1,-1,-1):
        d,s,t = dst[i]
        if d<x:
            break
        e[s].append(t)
        e[t].append(s)
        
    dist = [-1]*N
    dist[0] = 0
    v.append(0)
    while v:
        ix = v.popleft()
        
        for jx in e[ix]:
            if dist[jx] != -1:
                continue
            dist[jx] = dist[ix] + 1
            v.append(jx)
    if dist[N-1] == -1:
        return False
    else:
        return dist[N-1]
        
x = 0
y = 10**10
while y-x>1:
    mid = (y+x)//2
    if is_ok(mid):
        x = mid
    else:
        y = mid
print(x,is_ok(x))