#include <algorithm>
#include <vector>
using namespace std;

#define pb push_back
#define mp make_pair
#define DIM 100005
#define sc second
#define fs first

vector <pair <int,int> > g[DIM];
int viz[DIM],cul[DIM];
int n,m;

void read ()
{
    int i,x,y,z;

    scanf ("%d%d",&n,&m);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d%d",&x,&y,&z);
        g[x].pb (mp (y,z));
        g[y].pb (mp (x,z));
    }
}

int df_try (int nod,int mt)
{
    vector <pair <int,int> > :: iterator it;
    int ok;

    ok=1;
    viz[nod]=2;
    cul[nod]=mt+1;
    for (it=g[nod].begin (); it!=g[nod].end (); ++it)
        if (!viz[it->fs])
        {
            if (it->sc==0 && mt==0)
                ok&=df_try (it->fs,1);
            else if (it->sc==1 && mt==1)
                ok&=df_try (it->fs,0);
            else if (it->sc==2)
                ok&=df_try (it->fs,mt);
        }
        else
        {
            if (it->sc==0 && cul[nod]==1 && cul[it->fs]==1)
                return 0;
            else if (it->sc==1 && cul[nod]==2 && cul[it->fs]==2)
                return 0;
            else if (it->sc==2 && cul[nod]!=cul[it->fs])
                return 0;
        }
    return ok;
}

void df_atrib (int nod,int mt)
{
    vector <pair <int,int> > :: iterator it;

    viz[nod]=1;
    cul[nod]=mt+1;
    for (it=g[nod].begin (); it!=g[nod].end (); ++it)
        if (viz[it->fs]!=1)
        {
            if (it->sc==0 && mt==0)
                df_atrib (it->fs,1);
            else if (it->sc==1 && mt==1)
                df_atrib (it->fs,0);
            else if (it->sc==2)
                df_atrib (it->fs,mt);
        }
}

void solve ()
{
    int i;

    for (i=1; i<=n; ++i)
        if (!cul[i])
            if (df_try (i,0))
                df_atrib (i,0);
            else
                df_atrib (i,1);
}

void print ()
{
    int i;

    for (i=1; i<=n; ++i)
        printf ("%d ",cul[i]-1);
}

int main ()
{
    freopen ("andrei.in","r",stdin);
    freopen ("andrei.out","w",stdout);

    read ();
    solve ();
    print ();

    return 0;
}