from collections import defaultdict, deque


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

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

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members


N, M = map(int, input().split())

edges = [list(map(int, input().split())) for _ in range(M)]
edges.sort(key=lambda x: -x[2])


uf = UnionFind(N + 1)

w, c = 10 ** 10, 0
for s, t, d in edges:
    if uf.same(s, t):
        continue
    w = min(w, d)
    c += 1
    uf.union(s, t)

G = [[] for _ in range(N)]

for s, t, d in edges:
    if d >= w:
        G[s - 1].append(t - 1)
        G[t - 1].append(s - 1)

que = deque([(0, 0)])
visited = [0] * N
visited[0] = 1

while que:
    v, dist = que.popleft()

    if v == N - 1:
        print(w, dist)
        exit()

    for u in G[v]:
        if visited[u]:
            continue
        visited[u] = 1
        que.append((u, dist + 1))