#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

#include<cmath>

using namespace std;

const int M=2e5+;

int read(){

    int ans=,f=,c=getchar();

    while(c<''||c>''){if(c=='-') f=-; c=getchar();}

    while(c>=''&&c<=''){ans=ans*+(c-''); c=getchar();}

    return ans*f;

}

int n,m,ans;

struct node{int from,to,w;}e[M];

int cmp(node x,node y){return x.w<y.w;}

int f[M],T;

int find(int x){return f[x]==x?x:f[x]=find(f[x]);}

int main(){

    n=read(); m=read(); T=n;

    for(int i=;i<=n;i++) f[i]=i;

    for(int i=;i<=m;i++) e[i].from=read(),e[i].to=read(),e[i].w=read();

    sort(e+,e++m,cmp);

    for(int i=;i<=m&&T>;ans=i,i++){

        int p=find(e[i].from),q=find(e[i].to);

        if(p==q) continue;

        f[p]=q; T--;

    }

    printf("%d %d\n",n-,e[ans].w);

    return ;

}