#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = (int)(2e5) + 5;
vector < pii > g[N];
int f[N];
int get(int k)
{
    return k == f[k] ? k : f[k] = get(f[k]);
}
pii dp[N];
int main(void)
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for (int i = 1;i <= n;++i)
        f[i] = i;
    while (m --)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        g[a].pb(mp(c,b));
        g[b].pb(mp(c,a));
    }
    vector < pii > ans;
    ll answer = 0;
    while (*min_element(f + 1,f + 1 + n) != *max_element(f + 1,f + 1 + n))
    {
        for (int i = 1;i <= n;++i)
            dp[i] = mp((int)(1e9),-1);
        for (int i = 1;i <= n;++i)
            for (auto it : g[i])
                if (get(i) != get(it.se))
                    smin(dp[get(i)],it);
        for (int i = 1;i <= n;++i)
            if (i == get(i))
            {
                if (i != get(dp[i].se))
                    answer += dp[i].fi,ans.pb(mp(i,dp[i].se)),f[get(dp[i].se)] = i;
            }
        for (int i = 1;i <= n;++i)
            f[i] = get(i);
    }
    cout << answer << '\n';
    cout << (n - 1) << '\n';
    for (auto it : ans)
        cout << it.fi << ' ' << it.se << '\n';
    return 0;
}