#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 < pair < int , pii > > g[N];
multiset < pair < int , pii > > ss;
int was[N];
void add(int node)
{
    was[node] = 1;
    for (auto it : g[node])
        if (ss.count(it))
            ss.erase(ss.find(it));
        else
            ss.insert(it);
}
int main(void)
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    while (m --)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        g[a].pb(mp(c,mp(a,b)));
        g[b].pb(mp(c,mp(a,b)));
    }
    add(1);
    ll answer = 0;
    vector < pii > ans;
    for (int i = 1;i < n;++i)
        {
            pii edge = ss.begin()->se;
            int node = -1;
            if (was[edge.fi])
                node = edge.se;
            else
                node = edge.fi;
            answer += ss.begin()->fi;
            add(node);
            ans.pb(edge);
        }
    cout << (answer) << '\n';
    cout << (n - 1) << '\n';
    for (auto it : ans)
        cout << it.fi << ' ' << it.se << '\n';
    return 0;
}