# 体重何キロまで行ける、は単調なので二分探索可能

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 heapq import heappush, heappop
INF = 10 ** 18
def dijkstra(s, n, connect): #(始点, ノード数)
    distance = [INF] * n
    que = [(0, s)] #(distance, node)
    distance[s] = 0
    confirmed = [False] * n # ノードが確定済みかどうか
    while que:
        w,v = heappop(que)
        if distance[v]<w:
            continue
        confirmed[v] = True
        for to, cost in connect[v]: # ノード v に隣接しているノードに対して
            if confirmed[to] == False and distance[v] + cost < distance[to]:
                distance[to] = distance[v] + cost
                heappush(que, (distance[to], to))
    return distance

def check(W):
    #W = 3
    edges = [[] for i in range(N+1)]
    for s, t, d in edge_list:
        if d >= W:
            edges[s].append((t, 1))
            edges[t].append((s, 1))
    distance = dijkstra(1, N+1, edges)
    #print(distance)
    if distance[N] == INF:
        return 0, distance[N]
    else:
        return 1, distance[N]

OK = 0
NG = 10**9+1
while NG-OK>1:
    mid = (NG+OK)//2
    if check(mid)[0] == 1:
        OK = mid
    else:
        NG = mid
ans_W = OK
ans_distance = check(ans_W)[1]
print(ans_W, ans_distance)