#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

class parser{
    public:
        parser() {}
        parser(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 parser &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;}
        ~parser(){
            input_file.close();}
    private:
        std::fstream input_file;
        static const int SIZE=0x400000; ///4MB
        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 (!n)
                nr[aux++]='0';
            for (;n;n/=10)
                nr[aux++]=n%10+'0';
            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; ///2MB
        int index=0,aux,n;
        char buffer[SIZE],nr[24];
        inline void inc(){
            if(++index==SIZE)
                index=0,output_file.write(buffer,SIZE);}
};

parser f ("apm.in");
writer t ("apm.out");

struct muchie{
    int from,to,cost;
}v[200010];

int n,m,cost_total=0,multime[200010],sol[200010];

int main()
{
    int index=0;
    f>>n>>m;
    for (int x,y,c,i=0;i<m;++i){
        f>>x>>y>>c;
        v[i]={x,y,c};
    }
    sort(v,v+m,[](muchie a,muchie b){return a.cost<b.cost;});
    for (int i=0;i<n;++i)
        multime[i]=i;
    for (int aux,i=0;i<m;++i){
        int a=v[i].from;
        while(a!=multime[a])
            aux=multime[multime[a]],multime[a]=aux,a=aux;
        int b=v[i].to;
        while(b!=multime[b])
            aux=multime[multime[b]],multime[b]=aux,b=aux;
        if(a!=b){
            cost_total+=v[i].cost;
            sol[index++]=i;
            multime[a]=b;
            if(index==(n-1))   break;
        }
    }
    t<<cost_total<<"\n"<<index<<"\n";
    for (int i=0;i<index;++i)
        t<<v[sol[i]].from<<" "<<v[sol[i]].to<<"\n";
    return 0;
}