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

int n, m, ans[200200], lev[200200], p[200200];
vector<array<int, 2>> v[200200];
array<int, 2> par[200200];

int find(int x) {
    if(x == p[x]) return x;
    return p[x] = find(p[x]);
}

void dfs(int u, int p) {
    lev[u] = lev[p]+1;
    for(auto [x, id] : v[u]) if(x != p) {
        par[x] = {u, id};
        dfs(x, u);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    vector<array<int, 3>> edge;
    for(int i=1;i<=m;i++) {
        int x, y, c; cin >> x >> y >> c;
        if(c) v[x].push_back({y, i}), v[y].push_back({x, i});
        else edge.push_back({x, y, i});
    }

    dfs(1, 0);
    iota(p+1, p+1+n, 1);
    int last = 1, cnt = 0;

    for(auto [x, y, i] : edge) {
        while(last < i) {
            if(!ans[last]) ans[last] = ++cnt;
            last++;
        }

        x = find(x), y = find(y);
        vector<int> l;
        while(x != y) {
            if(lev[x] < lev[y]) swap(x, y);
            l.push_back(par[x][1]), x = p[x] = find(par[x][0]);
        }
        sort(l.begin(), l.end());
        for(auto x : l) if(!ans[x]) ans[x] = ++cnt;
        ans[i] = ++cnt;
    }
    while(last <= m) {
        if(!ans[last]) ans[last] = ++cnt;
        last++;
    }

    for(int i=1;i<=m;i++) cout << ans[i] << " ";
}