#include <fstream>
#include <bits/stdc++.h>

using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int n, m, i, j, x1, y, c, d[200005], sum, parent[200005];
bool viz[200005];
struct nod
{
    int nod, cost;
}x;
vector <nod> v[200005];
struct comparecost
{
    bool operator()(const nod &a, const nod &b)
    {
        return a.cost>b.cost;
    }
};
priority_queue <nod, vector <nod>, comparecost> q;
void apm(int nodv)
{
    q.push({nodv, 0});
    while(!q.empty())
    {
        x=q.top();
        q.pop();
        viz[x.nod]=1;
          for(auto i: v[x.nod])
            if(d[i.nod]>i.cost && viz[i.nod]==0)
          {
              if(d[i.nod]!=1e9)
                 sum-=d[i.nod];
              d[i.nod]=i.cost;
              sum+=i.cost;
              parent[i.nod]=x.nod;
              q.push({i.nod, d[i.nod]});
          }

    }
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x1>>y>>c;
        v[x1].push_back({y, c});
        v[y].push_back({x1, c});
    }
    for(i=1; i<=n; i++)
        d[i]=1e9;
    d[1]=0;
    apm(1);
    fout<<sum<<'\n'<<n-1<<'\n';
    int nod=n;
    for(i=2; i<=n; i++)
        fout<<parent[i]<<" "<<i<<'\n';
    return 0;
}