样例过了，但10个点RE

//Kruskal
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct node{
	int s, e, w;
}edge[50000];
int f[310];
int n, m, maxx, k;

bool cmp(node a, node b) {
	return a.w <= b.w;
}

void init() {
	for(int i = 1; i <= n; i++) {
		f[i] = i;
	}
}

int find(int x) {
	if(f[x] != x) {
		f[x] = find(f[x]);
	}
	return f[x];
}

void Kruskal() {
	for(int i = 1; i <= m; i++) {
		int tx = find(edge[i].s);
		int ty = find(edge[i].e);
		if(tx != ty) {
			f[ty] = tx;
			k++;
			maxx = edge[i].w;
		}
		if(k == n - 1) {
			break;
		}
	}
}

int main() {
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		cin >> edge[i].s >> edge[i].e >> edge[i].w;
	}
	init();
	sort(edge + 1, edge + m + 1, cmp);
	Kruskal();
	cout << n - 1 << " " << maxx;
	return 0;
}