#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<queue>

 #include<stack>

 #include<map>

 #include<sstream>

 using namespace std;

 typedef long long ll;

 const int maxn = 1e5 + ;

 const int INF =  << ;

 int dir[][] = {,,,,-,,,-};

 int T, n, m;

 struct edge

 {

     int u, v, w;

     bool operator <(const edge& a)const

     {

         return w < a.w;

     }

 };

 edge a[maxn], ans[];

 int tot, maxx;

 int par[], high[];

 //初始化n个元素

 void init(int n)

 {

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

     {

         par[i] = i;

         high[i] = ;

     }

 }

 //查询树的根

 int Find(int x)

 {

     return par[x] == x ? x : par[x] = Find(par[x]);//路径压缩

 }

 void unite(int x, int y)

 {

     x = Find(x);

     y = Find(y);

     if(x == y)return;

     if(high[x] < high[y])par[x] = y;//y的高度高，将x的父节点设置成y

     else

     {

         par[y] = x;

         if(high[x] == high[y])high[x]++;

     }

 }

 bool same(int x, int y)

 {

     return Find(x) == Find(y);

 }

 int kruskal(int n, int m)//点数n，边数m

 {

     int sum_mst = ;//mst权值

     int num= ;//已经选择的边的边数

     sort(a, a + m);//边进行排序

     init(n);//初始化并查集

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

     {

         int u = a[i].u;

         int v = a[i].v;

         if(Find(u - ) != Find(v - ))//图最开始的下标是1，并查集是0

         {

             //printf("%d %d %d\n", u, v, a[i].w);

             ans[tot++] = a[i];

             maxx = max(maxx, a[i].w);

             sum_mst++;

             num++;

             unite(u - , v - );

         }

         if(num >= n - )break;

     }

     return sum_mst;

     //printf("weight of mst is %d\n", sum_mst);

 }

 int main()

 {

     while(cin >> n >> m)

     {

         tot = maxx = ;

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

         {

             scanf("%d%d%d", &a[i].u, &a[i].v, &a[i].w);

         }

         int sum = kruskal(n, m);

         cout<<maxx<<endl;

         cout<<sum<<endl;

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

             cout<<ans[i].u<<" "<<ans[i].v<<endl;

     }

     return ;

 }