#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N=2e5+2;
const int INF=1<<30;

vector<pair<int, int>> a[N];
bool in_arb[N];
int d[N], pred[N], n, cost;

void prim()
{
    for(int i=2; i<=n; i++)
        d[i]=INF;
    d[1]=0; cost=0;
    priority_queue<pair<int, int>> h;
    h.push({0, 1});
    while(!h.empty())
    {
        int x=h.top().second;
        h.pop();
        if(in_arb[x])
            continue;
        in_arb[x]=true;
        cost+=d[x];
        for(auto p:a[x])
        {
            int y=p.first, c=p.second;
            if(!in_arb[y]&& c<d[y])
            {
                d[y]=c;
                pred[y]=x;
                h.push({-c, y});
            }
        }
    }

}

int main()
{
    int m;
    in>>n>>m;
    for(int i=0; i<m; i++)
    {
       int x, y, c;
       in>>x>>y>>c;
       a[y].push_back({x, c});
       a[x].push_back({y, c});
    }
    prim();
    out<<cost<<'\n'<<n-1<<'\n';
    for(int i=1; i<=n; i++)
        if(pred[i]!=0)
            out<<pred[i]<<' '<<i<<'\n';

    return 0;
}