using namespace std;
#include<iostream>
#include<fstream>
#include<vector>
#define pb push_back
ofstream fout("apm.out");
struct rasp{int x,y;
};
struct edge{
int x,y,c;
};
#define nmax 200005
edge a[500005];
vector<rasp> ans;
int N,M;
int r[nmax],T[nmax];
bool cmp(edge i,edge j)
{
    return i.c<j.c;
}

void init()
{
    int i;
    for(i=1;i<=N;i++)
    {
        T[i]=i;
        r[i]=1;
    }
}

void unite(int x,int y)
{
    if(r[x]>r[y])
    {
        T[y]=x;
    }
    else T[x]=y;
    if(r[x]==r[y]) r[y]++;
}

int find(int x)
{
    int y,R;
    for(R=x;R!=T[R];R=T[R]);
    for(;x!=T[x];)
    {
        y=T[x];
        T[x]=R;
        x=y;
    }
    return R;
}

void solve()
{   int sum=0,i,k=0;
    for(i=1;k<N-1;i++)
    {
        if(find(a[i].x)!=find(a[i].y))
        {
            unite(find(a[i].x),find(a[i].y));
            ans.pb((rasp){a[i].x,a[i].y});
            sum+=a[i].c;
            k++;
        }
    }

    fout<<sum<<"\n";
    fout<<N-1<<"\n";
    for(i=0;i<N-1;i++)
    {
        fout<<ans[i].x<<" "<<ans[i].y<<"\n";
    }
}
void cit()
{

    ifstream fin("apm.in");
    int i,x,y,z;
    fin>>N>>M;
    for(i=1;i<=M;i++)
    {
        fin>>a[i].x>>a[i].y>>a[i].c;


    }
    sort(a+1,a+M+1,cmp);

    fin.close();
}

int main()
{

    cit();
    init();
    solve();
    fout.close();
    return 0;
}