from collections import deque
N,M = list(map(int,input().split()))
edge = [[] for _ in range(N)]
for _ in range(M):
    s,t,d = list(map(int,input().split()))
    s -= 1;t -= 1
    edge[s].append((t,d))
    edge[t].append((s,d))

def check(w):
    q = deque([0])
    visited = [False for _ in range(N)]
    while(q):
        now = q.popleft()

        if(visited[now]):continue
        visited[now] = True

        for v,d in edge[now]:
            if(w > d):continue
            q.append(v)
    return visited[-1]

def count(w):
    INF = 10**18
    q = deque([(0,0)])
    visited = [INF for _ in range(N)]
    while(q):
        now,dist = q.popleft()

        if(visited[now] != INF):continue
        visited[now] = dist

        for v,d in edge[now]:
            if(w > d):continue
            if(visited[v] <= dist + 1):continue
            q.append((v,dist+1))
    return visited[-1]

ok,ng = 0,10**9+1
while(ng - ok > 1):
    mid = (ok+ng)//2
    if(check(mid)):
        ok = mid
    else:
        ng = mid
W = ok
L = count(W)
print(W,L)