def main(): from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum from heapq import heapify, heappop, heappush from bisect import bisect_left, bisect_right from copy import deepcopy import copy import random from collections import deque,Counter,defaultdict from itertools import permutations,combinations from decimal import Decimal,ROUND_HALF_UP #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP) from functools import lru_cache, reduce #@lru_cache(maxsize=None) from operator import add,sub,mul,xor,and_,or_,itemgetter INF = 10**18 mod1 = 10**9+7 mod2 = 998244353 #DecimalならPython #再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!! ''' ''' class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n #親だけ self.edge = [0]*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 self.parents[x] > self.parents[y]: x, y = y, x self.edge[x] += 1 if x == y: return self.parents[x] += self.parents[y] self.edge[x] += self.edge[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()) uf = UnionFind(N+1) edge = [] for _ in range(M): u,v,w = map(int, input().split()) edge.append((u,v,w)) edge.sort(lambda x:x[2],reverse=True) G = [[] for _ in range(N+1)] mx = 0 for i in range(M): u,v,w = edge[i] if uf.same(1,N) and mx != w: break uf.union(u,v) mx = w G[u].append(v) G[v].append(u) Q = deque() Q.append((1,0)) seen = [0]*(N+1) while len(Q) > 0: pos,cnt = Q.popleft() if seen[pos] == 1: continue if pos == N: print(mx,cnt) exit() seen[pos] = 1 for nx in G[pos]: if seen[nx] == 0: Q.append((nx,cnt+1)) if __name__ == '__main__': main()