/**
 *    author:  otera    
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int n;
vector<vector<int>> g;

int r;
vector<int> c;
vector<int> depth;

void dfs(int v, int p, int val) {
    c[v] = val;
    for(auto nv: g[v]) {
        if(nv == p) continue;
        if(val == 1) {
            dfs(nv, v, 2);
        } else {
            dfs(nv, v, 1);
        }
    }
}

void solve() {
	cin >> n;
    c.assign(n, -1);
    depth.assign(n, -1);
    g.assign(n, vector<int>());
    rep(i, n - 1) {
        int a, b; cin >> a >> b; --a; --b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(0, -1, 1);
    vector<int> ans(n, -1);
    int cnt1 = 0, cnt2 = 0;
    rep(i, n) {
        if(c[i] == 1) {
            ++ cnt1;
        } else {
            ++ cnt2;
        }
    }
    if(cnt1 <= n / 3) {
        int n1 = 1, n2 = 2, n0 = 3;
        rep(i, n) {
            if(c[i] == 1) {
                c[i] = 0;
                ans[i] = n0;
                n0 += 3;
            }
        }
        rep(i, n) {
            if(ans[i] == -1){
                if(n0 <= n) {
                    ans[i] = n0;
                    n0 += 3;
                } else if(n1 <= n) {
                    ans[i] = n1;
                    n1 += 3;
                } else {
                    ans[i] = n2;
                    n2 += 3;
                }
            }
        }
    }
    else if(cnt2 <= n / 3) {
        int n1 = 1, n2 = 2, n0 = 3;
        rep(i, n) {
            if(c[i] == 2) {
                c[i] = 0;
                ans[i] = n0;
                n0 += 3;
            }
        }
        rep(i, n) {
            if(ans[i] == -1){
                if(n0 <= n) {
                    ans[i] = n0;
                    n0 += 3;
                } else if(n1 <= n) {
                    ans[i] = n1;
                    n1 += 3;
                } else {
                    ans[i] = n2;
                    n2 += 3;
                }
            }
        }
    }
    else {
        int n1 = 1, n2 = 2, n0 = 3;
        rep(i, n) {
            if(c[i] == 1) {
                if(n1 <= n) {
                    ans[i] = n1;
                    n1 += 3;
                } else if(n0 <= n) {
                    ans[i] = n0;
                    n0 += 3;
                }
            } else {
                if(n2 <= n) {
                    ans[i] = n2;
                    n2 += 3;
                } else if(n0 <= n) {
                    ans[i] = n0;
                    n0 += 3;
                }
            }
        }
    }
    rep(i, n) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 18560