#include <fstream>
#include<vector>
#include<algorithm>

using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct Edge {
    int v1, v2, cost;
    Edge(int V1, int V2, int c) {
        v1 = V1;
        v2 = V2;
        cost = c;
    }

    bool operator < (const Edge& e) const {
        return (cost < e.cost);
    }
};

class Graph {
    public:
    int n;
    vector<Edge> E;
    void addEdge(int a, int b, int c) {
        Edge e(a, b, c);
        E.push_back(e);
    }
}G;

vector<int> PARENT;
vector<int> RANK(G.n, 0);
vector<Edge> EDGES;

void makeSets(int n) {

    PARENT.resize(n);
    RANK.resize(n);

    for(int i=0; i<n; i++)
        PARENT[i] = i;
}

void unite (int root1, int root2) {
    PARENT[root1] = root2;
}

int findRoot(int node) {
    if(PARENT[node] == node) {
        return node;
    }
    else {
        return findRoot(PARENT[node]);
    }
}

int Kruskal (Graph &G) {

    makeSets(G.n);
    int total = 0;

    sort(G.E.begin(), G.E.end());

    for(int i=0; i<G.E.size(); i++) {
        Edge e = G.E[i];
        int r1 = findRoot(e.v1);
        int r2 = findRoot(e.v2);
        if(r1!=r2) {
            unite(r1, r2);
            EDGES.push_back(e);
            total += e.cost;
        }
    }

    return total;

}



int main()
{
    int m, a, b, c;
    fin>>G.n>>m;
    G.n ++;
    for(int i=0; i<m; i++) {
        fin>>a>>b>>c;
        G.addEdge(a, b, c);
    }

    int TOTAL = Kruskal(G);
    fout<<TOTAL<<'\n'<<EDGES.size()<<'\n';

    for(int i=0; i<EDGES.size(); i++) {
        Edge e = EDGES[i];
        fout<<e.v1<<" "<<e.v2<<" "<<'\n';
    }
    return 0;
}