package yukicoder;

import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;

public class No1473_2 {
	
	private static int n;
	private static List<List<Integer[]>> V;

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		n = scan.nextInt();
		int m = scan.nextInt();
		V = new ArrayList<List<Integer[]>>();
		for (int i = 0; i < n; i++) {
			V.add(new ArrayList<Integer[]>());
		}
		int max_d = 0;
		int min_d = Integer.MAX_VALUE;
		for (int i=0; i < m; i++) {
			int s = scan.nextInt() - 1;
			int t = scan.nextInt() - 1;
			int d = scan.nextInt();
			V.get(s).add(new Integer[] {t, d});
			V.get(t).add(new Integer[] {s, d});
			max_d = Math.max(max_d,  d);
			min_d = Math.min(min_d,  d);
		}
		scan.close();
		int[] l = new int[] {min_d - 1, 0}, r = new int[] {max_d + 1, 0};
		while (r[0] - l[0] > 1) {
			int mid = (r[0] + l[0]) / 2;
			int c = bfs(mid);
			if (c == 0) {
				r[0] = mid;
				r[1] = 0;
			} else {
				l[0] = mid;
				l[1] = c;
			}
		}
		System.out.println(String.format("%d %d", l[0],l[1]));
	}
	
	private static int bfs(int w) {
		boolean[] B = new boolean[n];
		List<Integer[]> q = new ArrayList<Integer[]>();
		q.add(new Integer[] {0, 0});
		B[0] = true;
		while (q.size() > 0) {
			Integer[] v = q.remove(0);
			if (v[0] == n-1) {
				return v[1];
			}
			B[v[0]] = true;
			for (Integer[] i : V.get(v[0])) {
				if (i[1] >= w && !B[i[0]]) {
					q.add(new Integer[] {i[0], v[1] + 1});
				}
			}
		}
		return 0;
	}

}