#include    <fstream>
#include    <algorithm>
using namespace std;
ifstream    fin("apm.in");
ofstream    fout("apm.out");
const int NMax = 400005;
pair <int,int> P[NMax];
int N, M, Total, TT[NMax], k, RG[NMax];
struct Edge{int x,y,c;}V[NMax];
bool Compare(Edge a, Edge b)
{
    return a.c < b.c;
}
int Find(int nod)
{
    while(TT[nod] != nod)
        nod = TT[nod];
    return nod;
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= M; i++)
        fin >> V[i].x >> V[i].y >> V[i].c;

    sort(V+1, V+M+1, Compare);
    for(int i = 1; i <= N; i++)
    {
        TT[i]=i;
        RG[i]=1;
    }
    for(int i=1;i<=M;i++)
    {
        int x=Find(V[i].x);
        int y=Find(V[i].y);
        if(x != y)
        {

            if(RG[x] < RG[y])
                TT[x] = y;
            if(RG[y] < RG[x])
                TT[y] = x;
            if(RG[x] == RG[y])
            {
                TT[x]=y;
                RG[y]++;
            }
            P[++k].first    =   V[i].x;
            P[k].second     =   V[i].y;
            Total           +=  V[i].c;
        }
    }

    fout << Total << "\n";
    fout << N-1 <<"\n";

    for(int i = 1; i <= k; i++)
        fout << P[i].first << " " << P[i].second << "\n";

    return 0;
}

/*
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
int n,m,tt[400010],xx,yy,rg[40010],q,k;
long long cost;
struct muchie{int x,y,c;}v[400010];
pair <int,int> q[400010];
bool comp(muchie a,muchie b)
{
    return a.c<b.c;
}
int tata(int nod)
{
    while(tt[nod]!=nod)
        nod=tt[nod];

    return nod;
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].c;
    }
    sort(v+1,v+m+1,comp);
    for(int i=1;i<=n;i++)
    {
        tt[i]=i;
        rg[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        xx=tata(v[i].x);
        yy=tata(v[i].y);
        if(xx!=yy)
        {
            cost+=v[i].c;
            if(rg[v[i].x]<rg[v[i].y])
                tt[xx]=tt[yy];
            else
            {
                if(rg[v[i].x]>rg[v[i].y])
                    tt[yy]=tt[xx];
                else
                {
                    tt[xx]=tt[yy];rg[xx]++;
                }
            }
            q[++k].first=v[i].x;
            q[k].second=v[i].y;
        }
    }
    fout<<cost<<'\n'<<n-1<<'\n';
    for(int i=1;i<=k;i++)
    {
        fout<<q[i].first<<" "<<q[i].second<<'\n';
    }
    return 0;
}
*/