#include<bits/stdc++.h>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

int n, m, root[200005], sz[200005], total, k;
struct p{
    int x, y, cost;
}apm[200005], v[400005];
int getroot(int x)
{
    while(root[x]!=x)
        x=root[x];
    return x;
}
void join(int x, int y)
{
    int rx=getroot(x);
    int ry=getroot(y);
    if(sz[rx]<sz[y])
        swap(rx, ry);
    sz[rx]+=sz[ry];
    root[ry]=rx;
}
bool cmp(p a, p b)
{
    return a.cost<b.cost;
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
        root[i]=i, sz[i]=1;
    for(int i=1; i<=m; i++)
        fin>>v[i].x>>v[i].y>>v[i].cost;
    sort(v+1, v+1+m, cmp);
    for(int i=1; i<=m; i++)
    {
        int rx=getroot(v[i].x);
        int ry=getroot(v[i].y);
        if(ry!=rx)
        {
            total+=v[i].cost;
            apm[++k].x=v[i].x;
            apm[k].y=v[i].y;
            join(v[i].x, v[i].y);
        }
    }
    fout<<total<<"\n"<<k<<"\n";
    for(int i=1; i<=k; i++)
        fout<<apm[i].y<<" "<<apm[i].x<<"\n";

    return 0;
}