# include <cstdio>
# include <vector>
# include <queue>
using namespace std;
FILE *f=freopen("apm.in","r",stdin);
FILE *g=freopen("apm.out","w",stdout);
const int N_MAX=200001;
const int M_MAX=400001;
int n,m;
int cost_sol;

bool rez[N_MAX];

class vecin{
public:
    int capat, cost;

    vecin (int a,int b)
    {
        this->capat=a;
        this->cost=b;
    }
};
vector <vecin> G[N_MAX];
class muchie{
public:
    int a,b,cost;

    muchie (int a, int b, int cost)
    {
        this->a=a;
        this->b=b;
        this->cost=cost;
    }

    bool operator< (const muchie &other) const
    {
        return this->cost > other.cost;
    }
};
priority_queue <muchie> candidati;
vector <muchie> Solutie;
void read()
{
    scanf("%d %d",&n,&m);
    for (int i=1;i<=m;i++)
    {
        int x,y,c;
        scanf("%d %d %d",&x,&y,&c);
        G[x].push_back(vecin(y,c));
        G[y].push_back(vecin(x,c));
    }
}

void init()
{
    rez[1]=true;
    for (int i=0;i<G[1].size();i++)
    {
        candidati.push(muchie(1,G[1][i].capat,G[1][i].cost));
    }
}

void solve()
{
    while (!candidati.empty())
    {
        muchie mc=candidati.top();
        candidati.pop();
        if (!(rez[mc.a] && rez[mc.b]))
        {
            int nod_nou;
            Solutie.push_back(mc);
            if (!rez[mc.a]) nod_nou=mc.a;
            else nod_nou=mc.b;
            cost_sol+=mc.cost;
            for (int i=0;i<G[nod_nou].size();i++)
            {
                candidati.push(muchie(nod_nou,G[nod_nou][i].capat,G[nod_nou][i].cost));
            }
            rez[nod_nou]=true;
        }
    }
}

void write()
{
    printf("%d\n",cost_sol);
    printf("%d\n",Solutie.size());
    for (int i=0;i<Solutie.size();i++)
    {
        printf("%d %d\n",Solutie[i].a, Solutie[i].b);
    }
}
int main()
{
    read();
    init();
    solve();
    write();
    return 0;
}