import heapq

n,m=map(int,input().split())
v=[[] for i in range(n)];
ans=[(1,-1)]*n
for i in range(m):
    a,b,c=map(int,input().split())
    a-=1;b-=1;c=-c
    v[a].append((b,c));v[b].append((a,c))
hq=[]
ans[0]=(-1<<30,0);heapq.heappush(hq,(-1<<30,0,0))
while hq:
    a,b,c=heapq.heappop(hq)
    if ans[c]<(a,b):
        continue
    for i,j in v[c]:
        if ans[i]>(max(a,j),b+1):
            ans[i]=(max(a,j),b+1)
            heapq.heappush(hq,(max(a,j),b+1,i))

print(-ans[-1][0],ans[-1][1])