#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>

using namespace std;

struct coord
{
    int x, y, cost;
};

const int NMAX = 2e5 + 5, MMAX = 4e5 + 5;
int n, m, rang[NMAX], tata[NMAX], par1, par2;
long long suma = 0;
coord v[MMAX];

bool fcmp(coord x, coord y)
{
    if(x.cost < y.cost)
        return true;
    return false;
}

int find_tata(int nod)
{
    while(tata[nod] != -1)
        nod = tata[nod];
    return nod;
}

void citire()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        cin >> v[i].x >> v[i].y >> v[i].cost;
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    freopen("apm.in", "r", stdin);
    freopen("apm.out", "w", stdout);    
    citire();
    for(int i = 1; i <= n; i++)
    {
        tata[i] = -1;
    }

    sort(v + 1, v + m + 1, fcmp);

    vector<pair<int, int>> ans;
    ans.reserve(m);

    for(int i = 1; i <= m; i++)
    {   
        int x = v[i].x, y = v[i].y, cost = v[i].cost;
        par1 = find_tata(v[i].x);
        par2 = find_tata(v[i].y);
        if(par1 != par2)
        {
            ans.push_back({x, y});
            if(rang[x] < rang[y])
            {
                swap(x, y);
                swap(par1, par2);
            }
            rang[x] = rang[y];
            if(x == y)
                rang[x]++;
            tata[par2] = par1;

            suma += cost;            
        }
    }
    
    cout << suma << "\n" << ans.size() << "\n";
    for(int i = 0; i < ans.size(); i++)
        cout << ans[i].first << " " << ans[i].second << "\n";
}