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

struct muchie{
    int x, cost;
};

int c[dim], viz[dim], tata[dim];

vector <muchie> l[dim];
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;

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