#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifdef LOCAL
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) ;
#endif

vector<string> vec_splitter(string s)
{
    s += ',';
    vector<string> res;
    while (!s.empty())
    {
        res.push_back(s.substr(0, s.find(',')));
        s = s.substr(s.find(',') + 1);
    }
    return res;
}

void debug_out(
        vector<string> __attribute__ ((unused)) args,
        __attribute__ ((unused)) int idx,
        __attribute__ ((unused)) int LINE_NUM)
{
    cerr << endl;
}

template<typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T)
{
    if (idx > 0)
        cerr << ", ";
    else
        cerr << "Line(" << LINE_NUM << ") ";
    stringstream ss;
    ss << H;
    cerr << args[idx] << " = " << ss.str();
    debug_out(args, idx + 1, LINE_NUM, T...);
}

typedef long long ll;
typedef long double ld;
#define rep(i, start, end) for(int i = start; i < end; ++i)
#define sz(x) (int)((x).size())
#define pb push_back
#define all(x) x.begin(), x.end()
#define clr(d, v) memset(d, v, sizeof(d))
#define pii pair<int, int>
#define X first
#define Y second
//#define debug(x) cerr << #x << " : " << (x) << " "
const long double PI = 3.14159265358979323846;
const long double eps = (1e-15);
//enum
//{
//    LESS, EQUAL, GREATER
//};

//int dcmp(ld x, ld y, ld EPS = eps)
//{
//    if (fabs(x - y) <= EPS)
//        return EQUAL;
//    return x > y ? GREATER : LESS;
//}
int n;
const int MAX_N = 2e5 + 5;
vector<pair<int, int> > adj[MAX_N];
int val[MAX_N];
enum {EQUAL, NOT_EQUAL};
void dfs(int u, int state, int num)
{
    if (state == EQUAL)
        val[u] = num;
    else
    {
        val[u] = 1;
        if (num == 1)
            val[u]++;
    }

    for (auto e : adj[u])
    {
        int v = e.first, c = e.second;
        if (val[v] != -1)
            continue;
        if (c == val[u])
            dfs(v, NOT_EQUAL, c);
        else
            dfs(v, EQUAL, c);
    }
}
void myMain()
{
    cin >> n;
    int m;
    cin >> m;
    for (int i = 0; i < m; ++i)
    {
        int u, v, c;
        cin >> u >> v >> c;
        --u; --v;
        adj[u].pb({v, c});
        adj[v].pb({u, c});
    }
    clr(val, -1);
    dfs(0, EQUAL, 1);
    for (int u = 0; u < n; ++u)
        cout << val[u] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    int tc = 1;
//    cin >> tc;
    while(tc--)
        myMain();
}
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n)  for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
template<class Iter> void __kumaerrc(Iter begin, Iter end) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; }
void __kumaerr(istream_iterator<string> it) { (void)it; cerr<<endl; }
template<typename T, typename... Args> void __kumaerr(istream_iterator<string> it, T a, Args... args) { cerr<<*it<<"="<<a<<", ",__kumaerr(++it, args...); }
template<typename S, typename T> std::ostream& operator<<(std::ostream& _os, const std::pair<S,T>& _p) { return _os<<"{"<<_p.first<<','<<_p.second<<"}"; }
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); __kumaerr(_it, args); }
#define dumpc(ar) { cerr<<#ar<<": "; FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
#define dumpC(beg,end) { cerr<<"~"<<#end<<": "; __kumaerrc(beg,end); }
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg,end)
#endif
struct UF {
public:
  int N,G/* # of disjoint sets */;
  UF(int N): N(N) { init(N); }
  void init(int N) {
    par=vector<int>(N),sz=vector<int>(N,1);
    for(int i=0; i<N; ++i) par[i]=i,sz[i]=1;
    G=N;
  }
  int find(int x) { return par[x]==x?x:par[x]=find(par[x]); }
  int size(int x) { return sz[find(x)]; }
  bool sameset(int x, int y) { return find(x)==find(y); }
  int unite(int x, int y) {
    x=find(x),y=find(y);
    if(x==y) return x;
    int p=x,c=y;
    if(sz[p]<sz[c]) swap(p,c);
    G--,sz[p]=sz[c]=sz[p]+sz[c];
    par[c]=p;
    return p;
  }
private:
  vector<int> par,sz;
};
// $ cp-batch KeepGraphConnected | diff KeepGraphConnected.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address KeepGraphConnected.cpp && ./a.out

/*

 11/21/2020

 21:31-

 */

const int MAX_N=1e6+1;
III E[MAX_N];
int N,M;

vector<II> G[MAX_N];
void solve() {
  REP(i,M) {
    int u,v,c; tie(u,v,c)=E[i];
    G[u].emplace_back(v,c),G[v].emplace_back(u,c);
  }
  VI res(N);
  VI viz(N);
  queue<int> Q;
  Q.emplace(0),viz[0]=1,res[0]=0;
  while(SZ(Q)) {
    int u=Q.front(); Q.pop();
    FORR(p,G[u]) {
      int v,c; tie(v,c)=p;
      if(viz[v]) continue;
      int col;
      if(res[u]!=c) col=c;
      else col=(c+1)%N;
      res[v]=col,viz[v]=1,Q.emplace(v);
    }
  }

  UF uf(N);
  REP(i,M) {
    int u,v,c; tie(u,v,c)=E[i];
    if(res[u]==c&&res[v]!=c) uf.unite(u,v);
    else if(res[v]==c&&res[u]!=c) uf.unite(u,v);
  }
  assert(uf.G==1);

  REP(i,N) cout<<res[i]+1<<endl;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout<<setprecision(12)<<fixed;

  cin>>N>>M;
  REP(i,M) {
    int u,v,c; cin>>u>>v>>c;
    --u,--v,--c;
    E[i]={u,v,c};
  }
  solve();

  return 0;
}
