import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, M = map(int, input().split())
E = [[] for _ in range(N)]
for _ in range(M):
    s, t, d = map(int, input().split())
    s -= 1
    t -= 1
    E[s].append((d, t))
    E[t].append((d, s))

INF = 1 << 30
l = -1
r = INF
while r - l > 1:
    w = (l + r) // 2

    dq = deque([0])
    C = [INF] * N
    C[0] = 0
    while len(dq) > 0:
        v = dq.popleft()
        if v == N - 1:
            break
        for d, dest in E[v]:
            if w > d:
                continue
            if C[dest] > C[v] + 1:
                C[dest] = C[v] + 1
                dq.append(dest)
    if C[N - 1] < INF:
        l = w
        ans = C[N - 1]
    else:
        r = w
print(l, ans)