import sys
readline = sys.stdin.readline
from collections import *

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]
    
def bfs(G, s, N):
    Q = deque([])
    dist = [-1] * N
    par = [-1] * N
    dist[s] = 0
    for u in G[s]:
        par[u] = s
        dist[u] = 1
        Q.append(u)

    while Q:
        u = Q.popleft()
        for v in G[u]:
            if dist[v] != -1:
                continue
            dist[v] = dist[u] + 1
            par[v] = u
            Q.append(v)
            
    return dist


N, M = map(int, readline().split())
D = defaultdict(list)
L = []
for i in range(M):
    s, t, d = map(int, readline().split())
    s, t = s - 1 , t - 1
    D[d].append((s, t))
    
for k, v in D.items():
    L.append((k, v))
L.sort()
ans = 10 ** 18
U = UnionFind(N)
G = [[] for i in range(N)]
while L:
    ans, lst = L.pop()
    for s, t in lst:
        U.union(s, t)
        G[s].append(t)
        G[t].append(s)
    if not U.is_same(0, N - 1):
        continue
    D = bfs(G, 0, N)
    print(ans, D[-1])
    exit()