#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <fstream>
using namespace std;

#define NMax 200005
#define oo (1 << 30)
typedef pair<int, int> iPair;

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

int T[NMax], n, m, C[NMax];
bool inmst[NMax];
struct comp{
    bool operator()(int x, int y)
    {
        return C[x] > C[y];
    }
};
vector <pair <int, int> > G[NMax];
priority_queue<int, vector <int>, comp> pq;

void Prim()
{
    for(int i = 1; i <= n; i++)
        C[i] = oo;
    pq.push(1);
    C[1] = 0;
    while(!pq.empty())
    {
        int nod = pq.top();
        pq.pop();
        inmst[nod] = 1;
        for(int i = 0; i < G[nod].size(); i++)
        {
            int v = G[nod][i].first;
            int c = G[nod][i].second;
            if(!inmst[v] && C[v] >= c)
            {
                C[v] = c;
                pq.push(v);
                T[v] = nod;
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
        G[y].push_back(make_pair(x, c));
    }
    Prim();
    int ct = 0;
    for(int i = 1; i <= n; i++)
        ct += C[i];
    fout << ct << "\n" << n-1 << "\n";
    for(int i = 1; i <= n; i++)
    {
        if(T[i] == 0) continue;
        fout << i << " " << T[i] << "\n";
    }
}