#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define Nmax 200000
#define INF 1e9
#define Mmax 400000

using namespace std;

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

vector<pair<int,int>> g[Mmax + 5];
int TT[Nmax + 5], d[Nmax + 5];
bool viz[Nmax + 5];
int n , sum , m , x , y , c;
/*vector<pair<pair<int,int>,int>> g;
vector<pair<int,int>> sol;
int rang[Nmax + 5] ,TT[Nmax + 5];
int n,m,sum,x,y,c;

int Find(int Node)
{
    if(TT[Node] == Node)
        return Node;
    else
        return Find(TT[Node]);
}

void Unite(int x , int y)
{
    if(rang[x]<rang[y])
        swap(x,y);
    if(rang[x] == rang[y])
        rang[x]++;
    TT[y] = x;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g.push_back(make_pair(make_pair(x,y),c));
    }
    for(int i=1;i<=n;i++)
    {
        TT[i]=i;
    }
    sort(g.begin(),g.end(),[](auto &left,auto &right)
         {
            return left.second < right.second;
         });
    for(auto i : g)
    {
        int a = Find(i.first.first);
        int b = Find(i.first.second);

        if(a != b)
        {
            sum += i.second;
            Unite(a,b);
            sol.push_back(make_pair(i.first.first,i.first.second));
        }
    }

    fout << sum << '\n';
    fout << sol.size() << '\n';
    for(auto i : sol)
    {
        fout << i.first << " " << i.second << '\n';
    }
    return 0;
}
*/
void prim(int start)
{
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
    pq.push(make_pair(0,start));
    while(!pq.empty())
    {
        int Node = pq.top().second;
        pq.pop();
        if(!viz[Node])
        {
            for(auto i : g[Node])
            {
                if(!viz[i.second] && i.first<d[i.second])
                {
                    TT[i.second] = Node;
                    d[i.second] =  i.first;
                    pq.push(make_pair(i.first,i.second));
                }
            }
        }
        viz[Node] = true;
    }
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(c,y));
        g[y].push_back(make_pair(c,x));
    }
    for(int i=2;i<=n;i++)
        d[i]=INF;
    prim(1);
    for(int i=2;i<=n;i++)
    {
        sum += d[i];
    }
    fout << sum << '\n';
    fout << n-1 << '\n';
    for(int i=2;i<=n;i++)
    {
        fout << i << " " << TT[i] <<'\n';
    }
}