#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>

#define NMAX 200005
#define MMAX 400005
#define inf 0x3f3f3f3f

using namespace std;

int N,M;
vector<pair<int,int> > graf[NMAX];

void citire()
{
    scanf("%d%d",&N,&M);
    for(int i=1; i<=M; i++)
    {
        int x,y,c;
        scanf("%d%d%d",&x,&y,&c);
        graf[x].push_back(make_pair(y,c));
        graf[y].push_back(make_pair(x,c));
    }
}

priority_queue<pair<int,int> > q; /// (-cost, nod)
int used[NMAX];
int t[NMAX]; ///tatal lui i
int d[NMAX]; ///costul muchiei in care este angajat i

int suma,nr;

void prim()
{
    for(int i=1;i<=N;i++)
        d[i]=inf;

    q.push(make_pair(0,1));
    while(!q.empty())
    {
        int nod_curent = q.top().second;
        int cost_curent = -q.top().first;

        q.pop();

        if(used[nod_curent])
            continue;

        suma+=cost_curent;
        nr++;
        used[nod_curent]=1;

        for(vector<pair<int,int> >::iterator ii = graf[nod_curent].begin(); ii!=graf[nod_curent].end(); ii++)
        {
            int nod_nou = ii->first;
            int cost_nou = ii->second;
            if(cost_nou < d[nod_nou] && !used[nod_nou])
            {
                t[nod_nou]=nod_curent;
                d[nod_nou]=cost_nou;
                q.push(make_pair(-cost_nou,nod_nou));
            }
        }

    }
}

void afisare()
{
    printf("%d\n%d\n",suma,nr-1);
    for(int i=2;i<=N;i++)
        if(used[i])
            printf("%d %d\n",i,t[i]);
}

int main()
{
    freopen("apm.in","r",stdin);
    freopen("apm.out","w",stdout);
    citire();
    prim();
    afisare();
    return 0;
}