#include<bits/stdc++.h>
using namespace std;
struct bx{
	int a,b,c;
};
bx dl[301];
int jc[100001];
int n,m,maxn=-9999999,s,tot=0;
bool bj(bx x,bx y){
	return x.c<y.c;
}
int find(int x){
	if(x==jc[x])
		return x;
	else
		return jc[x]=find(jc[x]);
}
void hb(int x,int y){
	x=find(x);
	y=find(y);
	if(x!=y)
		jc[x]=y;
}
void kruskal(){
	sort(dl+1,dl+m+1,bj);
	for(int i=1;i<=m;i++){
		int o=dl[i].a;
		int p=dl[i].b;
		int q=dl[i].c;
		int r1=find(o),r2=find(p);
		if(r1!=r2){
			maxn=max(maxn,q);
			hb(r1,r2);
			tot++;
			if(tot==n-1)
				break;
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		jc[i]=i;
	for(int i=1;i<=m;i++)
		cin>>dl[i].a>>dl[i].b>>dl[i].c;
	kruskal();
	cout<<n-1<<" "<<maxn;
	return 0;
}