#include <bits/stdc++.h>
using namespace std;

array <int, 4> v[3009];
int par[3009], in[3009], t, bo[3009];

vector <pair <int, int> > adj[3009];

int fnd(int a){
    if(par[a] == a) return a; else return par[a] = fnd(par[a]);
}

void mrg(int a, int b){
    a = fnd(a);
    b = fnd(b);

    if(a == b) return;

    par[b] = a;
}

vector <int> st;
vector <pair <int, int> > ans;
int edge;

void dfs(int v){
    bo[v] = 1;
    for(auto to:adj[v]){
        if(to.first == t){
            //cout << "found\n";
            st.push_back(to.second);
            for(int j = 0; j < st.size(); j++){
                if(in[st[j]]){
                    in[st[j]] = 0;
                    ans.push_back({edge, st[j]});
                    t = -1;
                    return;
                }
            }
            return;
        }

        if(bo[to.first]) continue;
        st.push_back(to.second);
        dfs(to.first);
        if(t == 1) return;
    }

    st.pop_back();
}

int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        cin >> v[i][2] >> v[i][3] >> v[i][0];
        if(i < n){
            v[i][1] = -i;
        }else{
            v[i][1] = i;
        }
    }

    sort(v + 1, v + m + 1);

    for(int i = 1; i <= n; i++) par[i] = i;
    for(int i = 1; i <= m; i++){
        if(fnd(v[i][2]) != fnd(v[i][3])){
            mrg(v[i][2], v[i][3]);
            adj[v[i][2]].push_back({v[i][3], abs(v[i][1])});
            adj[v[i][3]].push_back({v[i][2], abs(v[i][1])});
            in[i] = 1;
        }
    }

    vector <int> a, b;
    for(int i = 1; i <= m; i++){
        if(v[i][1] < 0 && in[i] == 0){
            b.push_back(-v[i][1]);
        }

        if(v[i][1] > 0 && in[i] == 1){
            a.push_back(v[i][1]);
        }
    }

    for(int i = 0; i < a.size(); i++) ans.push_back({b[i], a[i]});

    cout << ans.size() << endl;
    for(int i = 0; i < ans.size(); i++){
        cout << ans[i].first << " " << ans[i].second << "\n";
    }
    return 0;
}