#include <fstream>
#include <algorithm>
#include <stack>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
const int maxx = 400001;
const int nmax = 200001;
int n, m;
int t[nmax], rang[nmax];
stack < pair < int , int > > st;
struct muchii
{
    int x, y, c;
};
muchii muc[maxx];
bool sortare(muchii m1, muchii m2)
{
    if(m1.c > m2.c)
        return false;
    return true;
}
int Root(int k)
{
    if(t[k] == 0)
        return k;
    else
    {
        int x = Root(t[k]);
        t[k] = x;
        return x;
    }
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> muc[i].x >> muc[i].y >> muc[i].c;
    }
    sort(muc + 1, muc + m + 1, sortare);
    int cnt = 0;
    long long cost = 0;
    for(int i = 1; i <= m && cnt < n; i++)
    {
        int r1 = Root(muc[i].x), r2 = Root(muc[i].y);
        if(r1 != r2)
        {
            st.push(make_pair(muc[i].x, muc[i].y));
            cost += muc[i].c;
            cnt++;
            if(rang[r1] > rang[r2])
            {
                t[r2] = r1;
            }
            else
            {
                t[r1] = r2;
                if(rang[r1] == rang[r2])
                {
                    rang[r2]++;
                }
            }
        }
    }
    fout << cost << "\n";
    fout << st.size() << "\n";
    while(!st.empty())
    {
        fout << st.top().first << " " << st.top().second << "\n";
        st.pop();
    }
    return 0;
}