#include <bits/stdc++.h>
#include <algorithm>
#define maxn 200005
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n, m;
vector < pair < int, pair < int, int > > > margini;
int t[maxn];
int get_root(int x)
{
    int root=x;
    while(t[root]>0)
    {
        root=t[root];
    }
    while(x!=root)
    {
        int aux=t[x];
        t[x]=root;
        x=aux;
    }
    return root;
}

int join(int x, int y)
{
    int a=get_root(x);
    int b=get_root(y);
    if(a==b)
    {
        return 0;
    }
    if(t[a]<=t[b])
    {
        t[a]+=t[b];
        t[b]=a;
    }
    else
    {
        t[b]+=t[a];
        t[a]=b;
    }
    return 1;
}

int main()
{
    fin>>n>>m;
    int x, y, cost;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        margini.push_back(make_pair(cost, make_pair(x, y)));
    }
    sort(margini.begin(), margini.end());
    for(int i=1; i<=n; i++)
    {
        t[i]=-1;
    }
    int total=0;
    vector <pair<int, int > > sol;
    for(int i=0; i< (int) margini.size(); i++)
    {
        int cost=margini[i].first;
        int x=margini[i].second.first;
        int y=margini[i].second.second;
        if(join(x, y)==1)
        {
            total+=cost;
            sol.push_back(make_pair(x, y));
        }
    }
    fout<<total<<"\n"<<n-1<<"\n";
    for(int i=0; i<(int)sol.size(); i++)
    {
        fout<<sol[i].first<<" "<<sol[i].second<<"\n";
    }
    return 0;
}