#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define edge pair< int, int >
#define MAX 1001
// ( w (u, v) ) format
FILE * in = fopen("apm.in", "r");
FILE * out = fopen("apm.out", "w");

vector< pair< int, edge > > GRAPH, MST;

int parent[MAX], total, N, E;

int findset(int x, int *parent)
{
    if(x != parent[x])
        parent[x] = findset(parent[x], parent);
    return parent[x];
}
void kruskal()
{
    int i, pu, pv;
    sort(GRAPH.begin(), GRAPH.end()); // increasing weight
    for(i=total=0; i<E; i++)
    {
        pu = findset(GRAPH[i].second.first, parent);
        pv = findset(GRAPH[i].second.second, parent);
        if(pu != pv)
        {
            MST.push_back(GRAPH[i]); // add to tree
            total += GRAPH[i].first; // add edge cost
            parent[pu] = parent[pv]; // link
        }
    }
}
void reset()
{
    // reset appropriate variables here
    // like MST.clear(), GRAPH.clear(); etc etc.
    for(int i=1; i<=N; i++) parent[i] = i;
}
void print()
{
    int i, sz;
    // this is just style...
    sz = MST.size();
	fprintf(out,"%d\n%d\n", total,N-1);
    for(i=0; i<sz; i++)
    {
        fprintf(out,"%d ", MST[i].second.second);
        fprintf(out,"%d\n", MST[i].second.first);
        //fprintf(out,": %d\n", MST[i].first);
    }
    
}
int main()
{
    int i, u, v, w;
    fscanf(in,"%d %d", &N, &E);
    reset();
    for(i=0; i<E; i++)
    {
        fscanf(in,"%d %d %d", &u, &v, &w);
        GRAPH.push_back(pair< int, edge >(w, edge(u, v)));
    }
    kruskal(); // runs kruskal and construct MST vector
    print(); // prints MST edges and weights
    return 0;
}