#include <bits/stdc++.h>

using namespace std; const int maxn = 2e5 + 5; typedef long long ll;

int n, m, su[maxn], sv[maxn], sc[maxn];

struct edge { int v, w; }; vector<edge> T[maxn];

int P[maxn], M;

int fa[maxn], dep[maxn], a[maxn];

void DFS(int u, int f)
{
    fa[u] = f;
    dep[u] = dep[f] + 1;
    for (auto e : T[u]) if (e.v != f) a[e.v] = e.w, DFS(e.v, u);
}

int g[maxn];

inline int find(int u) { while (u != g[u]) u = g[u] = g[g[u]]; return u; }

int b[maxn], c;

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        scanf("%d%d%d", su + i, sv + i, sc + i);
        if (sc[i] == 1)
        {
            T[su[i]].push_back({ sv[i], i });
            T[sv[i]].push_back({ su[i], i });
        }
    }
    DFS(1, 0);
    for (int i = 1; i <= n; i++) g[i] = i;
    for (int i = 1; i <= m; i++) if (sc[i] == 0)
    {
        c = 0;
        for (int u = su[i], v = sv[i]; (u = find(u)) != (v = find(v)); )
        {
            if (dep[u] < dep[v]) b[++c] = a[v], g[v] = fa[v];
            else b[++c] = a[u], g[u] = fa[u];
        }
        sort(b + 1, b + c + 1);
        for (int j = 1; j <= c; j++) P[b[j]] = ++M;
        P[i] = ++M;
    }
    for (int i = 1; i <= m; i++) printf("%d ", P[i]); puts("");
}