#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100004;

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

struct Edge
{
    int u, v, weight;
    bool operator<(Edge const &other)
    {
        return weight < other.weight;
    }
};
int n, m;
int cost;
vector<Edge> edges;
vector<Edge> result;

struct DisjointSetUnion
{
    int p[NMAX];
    int size[NMAX];

    void init()
    {
        for (int i = 1; i <= n; i++)
        {
            p[i] = i;
            size[i] = 1;
        }
    }

    int find(int v)
    {
        if (v == p[v])
        {
            return v;
        }
        return p[v] = find(p[v]);
    }

    void unite(int u, int v)
    {
        int repr_u = find(u);
        int repr_v = find(v);
        if (repr_u != repr_v)
        {
            if (size[repr_v] < size[repr_u])
            {
                swap(repr_v, repr_u);
            }
        }
        p[repr_u] = repr_v;
        size[repr_v] += size[repr_u];
    }

} DSU;

void kruskal()
{
    sort(edges.begin(), edges.end());
    int edge_cnt = 0;
    DSU.init();
    for (auto edge : edges)
    {
        if (DSU.find(edge.u) != DSU.find(edge.v))
        {
            edge_cnt++;
            cost += edge.weight;
            result.push_back(edge);
            DSU.unite(edge.u, edge.v);
        }
        if (edge_cnt == n - 1)
        {
            break;
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        edges.push_back({a, b, c});
        edges.push_back({b, a, c});
    }
    kruskal();
    fout << cost << '\n';
    fout << n - 1 << '\n';
    for (auto edge : result)
    {
        fout << edge.u << ' ' << edge.v << '\n';
    }
    return 0;
}