#include <stdio.h>
#include <algorithm>

using namespace std;

struct node {
	int v , i;
	node *next;
} pool[410000] , *g[210000];
int top;
int n , m;
int u[210000] , v[210000] , col[210000];
int fa[210000] , faid[210000] , dep[210000];
int c[210000];
int buf[210000] , cnt;
int ans[210000] , index;
void add ( int u , int v , int i ) {
	node *tmp = &pool[++top];
	tmp -> v = v; tmp -> i = i; tmp -> next = g[u]; g[u] = tmp;
}
void dfs ( int i , int from ) {
	for ( node *j = g[i] ; j ; j = j -> next ) if ( j -> v != from ) {
		dep[j->v] = dep[i] + 1;
		fa[j->v] = i;
		faid[j->v] = j -> i;
		dfs ( j -> v , i );
	}
}
int find ( int x ) {
	int i , t;
	for ( i = x ; c[i] > 0 ; i = c[i] ) ;
	while ( c[x] > 0 ) {
		t = c[x];
		c[x] = i;
		x = t;
	}
	return i;
}
void get ( int x , int y ) {
	int t;
	x = find ( x );
	y = find ( y );
	while ( x != y ) {
		if ( dep[x] < dep[y] ) swap ( x , y );
		buf[++cnt] = faid[x];
		t = x;
		x = find ( fa[x] );
		c[t] = x;
		//printf ( "%d %d %d\n" , x , y , t );
	}
}
void work () {
	int i , j;
	scanf ( "%d%d" , &n , &m );
	for ( i = 1 ; i <= m ; i++ ) {
		scanf ( "%d%d%d" , &u[i] , &v[i] , &col[i] );
		if ( col[i] == 1 ) {
			add ( u[i] , v[i] , i );
			add ( v[i] , u[i] , i );
		}
	}
	dep[1] = 1;
	dfs ( 1 , -1 );
	for ( i = 1 ; i <= n ; i++ ) {
		c[i] = -1;
	}
	for ( i = 1 ; i <= m ; i++ ) {
		if ( ans[i] == 0 ) {
			if ( c[i] == 1 ) {
				if ( dep[u[i]] < dep[v[i]] ) swap ( u[i] , v[i] );
				c[u[i]] = fa[u[i]];
				ans[i] = ++index;
			}
			else {
				cnt = 0;
				get ( u[i] , v[i] );
				sort ( buf + 1 , buf + 1 + cnt );
				for ( j = 1 ; j <= cnt ; j++ ) ans[buf[j]] = ++index;
				ans[i] = ++index;
			}
		}
		//for ( j = 1 ; j <= m ; j++ ) printf ( "%d " , ans[j] );
		//printf ( "\n" );
	}
	for ( i = 1 ; i <= m ; i++ ) {
		printf ( "%d%c" , ans[i] , i==m?'\n':' ' );
	}
}
int main () {
	work ();
	return 0;
}