#include<cstdio>

 #include<algorithm>

 using namespace std;

 struct Edge{int u,v,w;void Read(){scanf("%d%d%d",&u,&v,&w);}}edges[];

 bool operator < (const Edge &a,const Edge &b){return a.w<b.w;}

 int n,m,fa[],rank[],tot;

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

 int findroot(int x)

 {

     if(x==fa[x]) return x;

     int rt=findroot(fa[x]);

     fa[x]=rt;

     return rt;

 }

 void Union(const int &U,const int &V)

 {

     if(rank[V]<rank[U]) fa[V]=U;

     else

       {

           fa[U]=V;

           if(rank[U]==rank[V]) ++rank[U];

       }

 }

 int main()

 {

     scanf("%d%d",&n,&m); init();

     for(int i=;i<=m;++i) edges[i].Read();

     sort(edges+,edges+m+);

     for(int i=;i<=m;i++)

       {

           int f1=findroot(edges[i].u),f2=findroot(edges[i].v);

           if(f1!=f2)

             {

                 Union(f1,f2);

                 tot++;

                 if(tot==n-)

                   {

                       printf("%d %d\n",n-,edges[i].w);

                       return ;

                   }

             }

       }

     return ;

 }