//#include <bits/stdc++.h>

 #include <cstdio>

 #include <vector>

 #include <iostream>

 #include <algorithm>

 #define INF 0x7f7f7f7f

 #define pii pair<int,int>

 #define LL long long

 using namespace std;

 const int N=;

 int seq[N], a[N], b[N], w[N], pre[N];

 int cmp(int a,int b)

 {

     return w[a]<w[b];

 }

 int find(int x)

 {

     return pre[x]==x? x: pre[x]=find(pre[x]);

 }

 vector<int> edge;

 int cal(int n, int m)

 {

     edge.clear();

     int ans=;

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

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

     {

         int u=find(a[seq[i]]);

         int v=find(b[seq[i]]);

         if( u!=v )

         {

             pre[u]=v;   //不是同个连通块，则连接。

             ans=max(ans, w[seq[i]]);

             edge.push_back(seq[i]);

         }

     }

     return ans;

 }

 int main()

 {

     freopen("input.txt", "r", stdin);

     int t, n, m;

     while(cin>>n>>m)

     {

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

         {

             seq[i]=i;

             scanf("%d%d%d", &a[i], &b[i], &w[i]);

         }

         sort(seq,seq+m,cmp);

         cout<<cal(n, m)<<endl;

         cout<<n-<<endl;

         for(int i=; i<edge.size(); i++)

         {

             int q=edge[i];

             printf("%d %d\n", a[q], b[q] );

         }

     }

     return ;

 }