#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];
vector <int> st;
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 (int nod,int mt)
{
    vector <pair <int,int> > :: iterator it;

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

void solve ()
{
    vector <int> :: iterator it;
    int i;

    for (i=1; i<=n; ++i)
        if (!viz[i])
        {
            st.clear ();
            if (!df (i,0))
            {
                for (it=st.begin (); it!=st.end (); ++it)
                    viz[*it]=0;
                df (i,1);
            }
        }
}

void print ()
{
    int i;

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

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

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

    return 0;
}