#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
typedef pair<int,int> Pair;
typedef pair<int,Pair> Pair2;
const int N=200009,M=400009;
int n,m,k,s;
int t[N];
Pair sol[N];
vector <Pair> v[N];
priority_queue <Pair2,vector <Pair2>,greater <Pair2> >h;
void solve()
{
    h.push(mp(0,mp(1,1)));
    while(!h.empty())
    {
        int cost=h.top().first,x=h.top().second.first,y=h.top().second.second;
        h.pop();
        if(t[y])
            continue;
        s+=cost;
        sol[++k]={x,y};
        t[y]=x;
        for(int i=0;i<v[y].size();i++)
            if(!t[v[y][i].second])
                h.push(mp(v[y][i].first,mp(y,v[y][i].second)));
    }
    fout<<s<<'\n'<<k-1<<'\n';
    for(int i=2;i<=k;i++)
        fout<<sol[i].first<<" "<<sol[i].second<<'\n';
}
int main()
{
    fin.sync_with_stdio(false);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].pb(mp(c,y));
        v[y].pb(mp(c,x));
    }
    solve();
    return 0;
}