using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((ll)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(ll (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (ll (i)=0;(i)<(ll)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define printll(x) printf("%lld",(x))
#define printsp() printf(" ")
#define newline() printf("\n")
#define readll(x) scanf("%lld",&(x))
#define debugll(x) fprintf(stderr,"%lld\n",(x))

#define IN "apm.out" //"code.in"
#define OUT "apm.in" //"code.out"
#define N_MAX (1<<18)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef pair<short int,short int> ps;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,M;
int cost(0),Dist[N_MAX],T[N_MAX],Nr[N_MAX];
bitset<N_MAX> viz;
vector< pair<int, pi> > V;
vector<pi> Sol;

// we need a dist function for prim
II int dist(int x,int y)
{
    return 1;
}

II void init(int N)
{
    memset(Dist,100,sizeof(Dist));
    Sol.resize(0);
    viz.reset();
    cost = 0;

    CC(T);
    V.resize(0);
    FOR(i,1,N)
        Nr[i] = 1;
}

II void add_edge(int x,int y,int cost)
{
    V.pb( mp(cost, mp(x, y) ) );
}

void add_edge(pair<int,pi> edge)
{
    V.pb(edge);
}

II void add(int x,int y)
{
    if(Nr[x] > Nr[y])
        Nr[x] += Nr[y],
        T[y] = x;
    else
        Nr[y] += Nr[x],
        T[x] = y;
}

II int rep(int nod)
{
    return (T[nod] ? T[nod] = rep(T[nod]) : nod);
}

II void Prim_MSP(int Src)
{
    Dist[Src] = 0;
    viz[Src] = true;
    FOR(i,1,N)
        Dist[i] = dist(Src,i), T[i] = Src;

    FOR(i,2,N)
    {
        int nod = 0;

        FOR(i,1,N)
            if(!viz[i] && Dist[i] < Dist[nod])
                nod = i;

        cost += Dist[nod];
        viz[nod] = true;
        Sol.pb( mp(T[nod],nod) );
        Dist[nod] = 0;

        FOR(i,1,N)
            if(!viz[i] && Dist[i] > dist(nod,i) )
                Dist[i] = dist(nod,i), T[i] = nod;
    }
}

II void Kruskal_MSP()
{
    sort( all(V) );

    FORit(it,V)
        if( rep(it->s.f) != rep(it->s.s) )
        {
            cost += it->f;
            add( rep(it->s.f), rep(it->s.s) );
            Sol.pb( mp(it->s.f, it->s.s) );
        }
}

//II int Kruskal()
//{
//    Kruskal_MSP();
//    return cost;
//}

II pair<int, vector<pi> > Kruskal()
{
    Kruskal_MSP();
    return mp(cost, Sol);
}

II pair<int, vector<pi> > Prim(int Src)
{
    Prim_MSP(Src);
    return mp(cost, Sol);
}

pair<int, vector<pi> > SolS;

int main()
{
    freopen(IN,"r",stdin);
    freopen(OUT,"w",stdout);

    int x,y,c;
    scanf("%d%d",&N,&M);
    init(N);

    FOR(i,1,M)
    {
        scanf("%d%d%d",&x,&y,&c);
        add_edge(x,y,c);
    }

    SolS = Kruskal();

    printf("%d\n%d\n",SolS.f,Size(SolS.s));
    FORit(it,SolS.s)
        printf("%d %d\n",it->f,it->s);
}