/*

 Problem: 1861        User:

 Memory: 416K        Time: 500MS

 Language: C++        Result: Accepted

 */

 #include <iostream>

 #include <algorithm>

 using namespace std;

 #define MAX 15010

 int p[];//存放父亲结点

 struct Edge

 {

     int u;

     int v;

     int w;

 }map[MAX],ans[MAX];

 bool cmp(Edge a,Edge b)

 {

     return a.w<b.w;

 }

 int Find(int a)

 {

     return a==p[a]?a:a=Find(p[a]);

 }

 int main()

 {

     int N,M,i;

     int a,b,c;

     cin>>N>>M;

     for(i=;i<=N;i++)

     {

         p[i] = i;

     }

     for(i=;i<M;i++)

     {

         cin>>a>>b>>c;

         map[i].u = a;

         map[i].v = b;

         map[i].w = c;

     }

     sort(map,map+M,cmp);

     int count = ;

     int maxEdge = ;

     for(i=;i<M;i++){

         int x = Find(map[i].u);

         int y = Find(map[i].v);

         if(x != y)

         {

             p[x] = y;//不在一个集合，合并

             ans[count].u = map[i].u;

             ans[count].v = map[i].v;

             count ++;

             if(map[i].w>maxEdge)

                 maxEdge = map[i].w;

         }

     }

     cout<<maxEdge<<endl;//路径中最长的边

     cout<<count<<endl;//边的总数

     for(i=;i<count;i++)

         cout<<ans[i].u<<" "<<ans[i].v<<endl;/输出每条路径

     return ;

 }