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

using namespace std;

#define pii pair<int,int>
ifstream cin("apm.in");
ofstream cout("apm.out");

int n,m,i,x,y,c,d[200010],t[200010];
bool viz[200010];

struct cmp
{
    bool operator()(pii x,pii y)
    {
        return x.second>y.second;
    }
};

vector<pair<int,int>>v[200010];
priority_queue<pii,vector<pii>,cmp>q;

void prim(int x)
{
    int inf=2000,vecin,cost;
    long long s=0;
    for(i=1; i<=n; i++)
        d[i]=inf;
    d[x]=0;
    q.push({x,0});
    while(!q.empty())
    {
        x=q.top().first;
        q.pop();
        if(viz[x]==1)
            continue;
        viz[x]=1;
        for(auto it:v[x])
        {
            vecin=it.first;
            cost=it.second;
            if(d[vecin]>cost && viz[vecin]==0)
            {
                    d[vecin]=cost;
                    t[vecin]=x;
                    q.push({vecin,cost});
            }
        }
    }
    for(i=2; i<=n; i++)
            s+=d[i];
    cout<<s<<'\n';
    cout<<n-1<<'\n';
    for(i=2;i<=n;i++)
        cout<<i<<" "<<t[i]<<'\n';
}

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        v[x].push_back({y,c});
        v[y].push_back({x,c});
    }
    prim(1);
    return 0;
}