#define inf 100000000
#define dim 200001
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchie{
    int nod, cost;
};

vector <muchie> l[dim];
priority_queue <pair<int, int>, vector <pair<int, int>>, greater<pair<int, int>>> pq;
int d[dim], tata[dim], viz[dim];

int main()
{
    int n, m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
        l[y].push_back({x, c});
    }
    for(i=2;i<=n;i++)
    {
        d[i]=inf;
    }
    d[1]=0;
    pq.push({0, 1});
    while(pq.empty()==0)
    {
        int nod=pq.top().second;
        pq.pop();
        if(viz[nod]==1)
        {
            continue;
        }
        viz[nod]=1;
        for(i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].nod;
            int cost=l[nod][i].cost;
            if(viz[vecin]==0)
            {
                if(d[vecin]>cost)
                {
                    d[vecin]=cost;
                    pq.push({d[vecin], vecin});
                    tata[vecin]=nod;
                }
            }
        }
    }
    int sol=0;
    for(i=1;i<=n;i++)
    {
        sol+=d[i];
    }
    fout<<sol<<"\n"<<n-1<<"\n";
    for(i=1;i<=n;i++)
    {
        if(tata[i]!=0)
        {
            fout<<i<<" "<<tata[i]<<"\n";
        }
    }
    return 0;
}