#include<bits/stdc++.h>
#define ll long long
#define fi first
#define sc second
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int n, m, dad[400001], sz[400001], sum;
vector<pair<int, int>>ans;
struct mch
{
    int x, y, cost;
}v[400001];
bool cmp(mch a, mch b)
{
    return a.cost<b.cost;
}
int Find(int x)
{
    if(dad[x]==x)
        return x;
    return dad[x]=Find(dad[x]);
}
void Union(int x, int y)
{
    if(sz[x]<=sz[y])
    {
        dad[x]=y;
        sz[y]+=sz[x];
    }
    else
    {
        dad[y]=x;
        sz[x]+=sz[y];
    }
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
        f>>v[i].x>>v[i].y>>v[i].cost;
    for(int i=1; i<=n; i++)
        dad[i]=i, sz[i]=1;
    sort(v+1, v+m+1, cmp);
    for(int i=1; i<=m; i++)
    {
        if(Find(v[i].x)!=Find(v[i].y))
        {
            Union(Find(v[i].x), Find(v[i].y));
            ans.push_back({v[i].x, v[i].y});
            sum+=v[i].cost;
        }
    }
    g<<sum<<'\n'<<ans.size()<<'\n';
    for(int i=0; i<ans.size(); i++)
        g<<ans[i].fi<<' '<<ans[i].sc<<'\n';
    return 0;
}