//Kruskal
#include <bits/stdc++.h>
using namespace std;

class Reader{
    public:
        Reader() {}
        Reader(const char *file_name){
            input_file.open(file_name,std::ios::in | std::ios::binary);
            input_file.sync_with_stdio(false);
            index&=0;
            input_file.read(buffer,SIZE);}
        inline Reader &operator >>(int &n){
            for (;buffer[index]<'0' or buffer[index]>'9';inc());
            n&=0;
            sign&=0;
            sign|=(buffer[index-1]=='-');
            for (;'0'<=buffer[index] and buffer[index]<='9';inc())
                n=(n<<1)+(n<<3)+buffer[index]-'0';
            n^=((n^-n)&-sign);
            return *this;}
        ~Reader(){
            input_file.close();}
    private:
        std::fstream input_file;
        static const int SIZE=0x400000;
        char buffer[SIZE];
        int index,sign;
        inline void inc(){
            if(++index==SIZE)
                index=0,input_file.read(buffer,SIZE);}
};

class Writer{
    public:
        Writer() {};
        Writer(const char *file_name){
            output_file.open(file_name,ios::out | ios::binary);
            output_file.sync_with_stdio(false);
            index=0;}
        inline Writer &operator <<(int target){
            aux=0;
            n=target;
            if (target<0)
                sign=-1;
            else
                sign=1;
            if (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=sign*(n%10)+'0';
            if (sign==-1){
                buffer[index]='-';inc();}
            for(;aux;inc())
                buffer[index]=nr[--aux];
            return *this;}
        inline Writer &operator <<(const char *target){
            aux=0;
            while (target[aux])
                buffer[index]=target[aux++],inc();
            return *this;}
        ~Writer(){
            output_file.write(buffer,index);output_file.close();}
    private:
        fstream output_file;
        static const int SIZE=0x200000;
        int index=0,aux,n,sign;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index=0,output_file.write(buffer,SIZE);}
};

Reader f ("apm.in");
Writer g ("apm.out");

int v[200001],n,m,t,a,b,aux,i,cost=0,lg=0,sol[400001],sz[200001];

struct edge
{
    int x;
    int y;
    int c;
    bool operator () (edge a,edge b)
    {
        return a.c<b.c;
    }
} T[400001];

int main()
{

    f>>n>>m;
    for(i=1; i<=m; ++i)
        f>>T[i].x>>T[i].y>>T[i].c;
    sort(T+1,T+1+m,edge());

    for(i=1; i<=n; ++i) v[i]=i,sz[i]=1;



    for(i=1; i<=m; i++)
        {
            a=T[i].x;
            while(a!=v[a]) aux=v[v[a]],v[a]=aux,a=aux;

            b=T[i].y;
            while(b!=v[b]) aux=v[v[b]],v[b]=aux,b=aux;

                if(a!=b)
                {
                    cost+=T[i].c;
                    sol[++lg]=i;

                    if(sz[a]<sz[b])
                        v[a]=b,sz[b]+=sz[a];
                    else
                        v[b]=a,sz[a]+=sz[b];

                    if(lg>=(n-1))   break;
                }
        }


    g<<cost<<"\n"<<lg<<"\n";
    for(i=1; i<n; i++)    g<<T[sol[i]].x<<" "<<T[sol[i]].y<<"\n";

}