#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,-1,0,1,1,-1,-1,1};
ll dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

int main(){
    int n,m; cin >> n >> m;
    vector<vpl> G(n);
    rep(i,m){
        int u,v,c; cin >> u >> v >> c; u--; v--; c--;
        G[u].emplace_back(v,c);
        G[v].emplace_back(u,c);
    }
    vl ans(n,-1);
    auto dfs = [&](auto &&dfs, int u) -> void{
        for(auto v : G[u]){
            if(ans[v.first] != -1) continue;
            if(ans[u] == v.second) ans[v.first] = (v.second+1) % n;
            else ans[v.first] = v.second;
            dfs(dfs,v.first);
            //cout << v.second << "\n";
        }
    };
    ans[0] = 0;
    dfs(dfs,0);
    rep(i,n) cout << ans[i]+1 << "\n";
}
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;

    vector<pair<int, int> > g[n];
    int ans[n];
    ans[0] = 1;


    for(int i = 0; i<m; i++){
        int u, v, c;
        cin >> u >> v >> c;

        g[u - 1].push_back({v - 1, c});
        g[v - 1].push_back({u - 1, c});
    }

    vector<pair<int, int> > dfs;
    int vis[n];
    fill(vis, vis + n, 0);
    vis[0] = 1;
    dfs.push_back({0, 1});

    while(!dfs.empty()){
        auto x = dfs.back();
        dfs.pop_back();

        for(auto to: g[x.first]){
            if(vis[to.first] == 0){
                vis[to.first] = 1;
                dfs.push_back(to);

                if(ans[x.first] == to.second){
                    if(ans[x.first] == 1) ans[to.first] = 2;
                    else ans[to.first] = 1;
                }

                else ans[to.first] = to.second;
            }
        }
    }

    for(int i = 0; i<n; i++){
        cout << ans[i] << endl;
    }

}
