#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

ifstream is("apm.in");
ofstream os("apm.out");

int N, M, Sol;
int Edge[400001], Weight[400001], X[400001], Y[400001];
int Set[200001];
vector <pair<int,int> > V;

void Input();
bool Comp(int i, int j);
int Find(int x);
void Unite(int i, int j);

int main()
{
    Input();

    for ( int i = 1; i <= M; ++i )
    {
        if ( Find(X[Edge[i]]) != Find(Y[Edge[i]]) )
        {
            Sol += Weight[Edge[i]];
            Unite(X[Edge[i]],Y[Edge[i]]);
            V.push_back(make_pair(X[Edge[i]],Y[Edge[i]]));
        }
    }

    os << Sol << '\n';
    os << V.size() << '\n';
    for ( int i = 0; i < V.size(); ++i )
        os << V[i].first << " " << V[i].second << '\n';

    is.close();
    os.close();
}

void Input()
{
    is >> N >> M;
    for ( int i = 1; i <= N; ++i )
        Set[i] = i;
    for ( int i = 1; i <= M; ++i )
    {
        is >> X[i] >> Y[i] >> Weight[i];
        Edge[i] = i;
    }
    sort(Edge+1,Edge+M+1,Comp);
}

bool Comp(int i, int j)
{
    return (Weight[i] < Weight[j]);
}

int Find(int x)
{
    if ( Set[x] == x ) return x;
    Set[x] = Find(Set[x]);

    return Set[x];
}

void Unite(int x, int y)
{
    Set[Find(x)] = Find(y);
    return;
}