#include<fstream>
#include<algorithm>

using namespace std;

struct apm
{
    int x,y,c;
};

apm a[200001];

int i,j,k,m,n,u;

int tata[200001],rang[200001],d[200001];


bool cmp( apm o1, apm o2)
{
    return o1.c<o2.c;
}


void uneste(int x,int y)
{
    if (rang[x]>rang[y]) tata[y]=x;
        else tata[x]=y;
    if (rang[x]==rang[y]) ++rang[y];
}

int radacina(int x)
{
    while (x!=tata[x]) x=tata[x];
    return x;
}

int main()
{
    ifstream cin("apm.in");
    ofstream cout("apm.out");
    cin>>n>>m;
    for (i=1; i<=n; ++i)
    {
        tata[i]=i;
        rang[i]=1;
    }
    for (i=1; i<=m; ++i) cin>>a[i].x>>a[i].y>>a[i].c;
    int s=0;
    sort(a+1,a+m+1,cmp);
    for (i=1; i<=m; ++i)
    {
        int x=radacina(a[i].x);
        int y=radacina(a[i].y);
        if (x!=y)
        {
            d[++k]=i;
            s+=a[i].c;
            uneste(x,y);
        }
    }
    cout<<s<<"\n";
    cout<<k<<"\n";
    for (i=1; i<=k; ++i) cout<<a[d[i]].x<<" "<<a[d[i]].y<<"\n";
    return 0;
}