class UnionFind:
    def __init__(self, n):
        self.par = [i for i in range(n+1)]
        self.rank = [0] * (n + 1)
        self.size = [1] * (n + 1)
 
    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 unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
            self.size[y] += self.size[x]
        else:
            self.par[y] = x
            self.size[x] += self.size[y]
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
 
    def same_check(self, x, y):
        return self.find(x) == self.find(y)

from collections import deque

n, m = map(int, input().split())
edges = [None] * m
for i in range(m):
    s, t, d = map(int, input().split())
    edges[i] = (d, s - 1, t - 1)
edges.sort(reverse=True)
uf = UnionFind(n)
res = 0
for w, s, t in edges:
    uf.unite(s, t)
    if uf.same_check(0, n - 1):
        res = w
        break
g = [[] for _ in range(n)]
for w, s, t in edges:
    if w >= res:
        g[s].append(t)
        g[t].append(s)
q = deque([0])
d = [-1] * n
d[0] = 0
while q:
    p = q.popleft()
    for node in g[p]:
        if d[node] == -1:
            d[node] = d[p] + 1
            q.append(node)
print(res, d[n - 1])