# UnionFind 参考は以下のサイト
# https://note.nkmk.me/python-union-find/
from collections import defaultdict
from collections import 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

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())


N,M = map(int, input().split())
Q = [[0] * 3 for i in range(M)] 
L = []
for i in range(N):
    L.append([])


for i in range(M):
    u,v,d = map(int, input().split())
    Q[i][0]=u-1
    Q[i][1]=v-1
    Q[i][2]=d
    L[u-1].append((v-1,d))
    L[v-1].append((u-1,d))

Q = sorted(Q, key=lambda x: x[2],reverse=True)
W = 0
uf = UnionFind(N)
for u,v,d in Q:
    uf.union(u,v)
    if uf.same(0,N-1):
        W=d
        break


q = deque()
qq = deque()
q.append(0)
qq.append(0)
ALL = [0]*N
while True:
    temp = q.popleft()
    tempq = qq.popleft()
    if temp==N-1:
        print(W,tempq)
        exit()
    for t,d in L[temp]:
        if ALL[t]==0 and W<=d:
            ALL[t]=1
            q.append(t)
            qq.append(tempq+1)