#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)
#define ALL(a) a.begin(), a.end()
#define pii pair<int,int>
#pragma GCC optimize("Ofast")
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define isSquare(x) (sqrt(x)*sqrt(x) == x)
template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };
template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };
inline void IN(void){return;}
template <typename First, typename... Rest> void IN(First& first, Rest&... rest){cin >> first;IN(rest...);return;}
inline void OUT(void){cout << "\n";return;}
template <typename First, typename... Rest> void OUT(First first, Rest... rest){cout << first << " ";OUT(rest...);return;}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long LLINF = 1e18;
long long lcm(ll a, ll b){return a * b / __gcd(a,b);}
struct IoSetup { IoSetup() {
    cin.tie(nullptr);ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
} } iosetup;
template< int mod > struct ModInt {
    int x; ModInt() : x(0) {}
    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}
    ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}
    ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}
    friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }
    static int get_mod() { return mod; }
}; using modint = ModInt< mod >;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> void Exit(T first){cout << first << endl;exit(0); };

template< typename T > struct edge {
   int src, to; T cost;
   edge(int to, T cost) : src(-1), to(to), cost(cost) {}
   edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
   edge &operator=(const int &x) { to = x; return *this;}
   operator int() const { return to; }
};
template< typename T > using Edges = vector< edge< T > >;
template< typename T > using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T > using Matrix = vector< vector< T > >;

int N;
UnWeightedGraph g;
vector<int> dist;
void dfs(int v, int p = -1){
    for(auto nv: g[v]){
        if(nv != p){
            dist[nv] = dist[v] + 1;
            dfs(nv, v);
        }
    }
}

int main(){
    iosetup;
    cin >> N;
    g.resize(N);
    dist.resize(N, 0);
    rep(i, 0, N - 1){
        int a, b; cin >> a >> b;a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    dfs(0);
    int cnt = 0;
    rep(i, 0, N){
        if(dist[i]%2 == 0) cnt++;
    }
    vector<bool> used(N + 1, false);
    vector<int> ans(N, -1);
    if(cnt <= N / 3){
        int tmp = 1;
        rep(i, 0, N){
            if(dist[i]%2 == 0){
                ans[i] = 3 * tmp;
                used[3 * tmp] = true;
                tmp++;
                if(tmp * 3 > N) break;
            }
        }
        int idx = 1;
        rep(i, 0, N){
            if(ans[i] == -1){
                ans[i] = idx;
                idx++;
                while(idx <= N && used[idx])idx++;
            }
        }
    }else if((N - cnt) <= N / 3){
        int tmp = 1;
        rep(i, 0, N){
            if(dist[i]%2 == 1){
                ans[i] = 3 * tmp;
                used[3 * tmp] = true;
                tmp++;
                if(3 * tmp > N) break;
            }
        }
        int idx = 1;
        rep(i, 0, N){
            if(ans[i] == -1){
                ans[i] = idx;
                idx++;
                while(idx <= N && used[idx])idx++;
            }
        }
    }else{
        int t0 = 1, t1 = 0, t2 = 0;
        bool flag1 = 0, flag2 = 0;
        rep(i, 0, N){
            if(dist[i] % 2 == 0){
                if(flag1){
                    ans[i] = t0 * 3;
                    t0++;
                }else{
                    ans[i] = 3 * t1 + 1;
                    t1++;
                    if(3 * t1 + 1 > N){
                        flag1 = true;
                    }
                }
            }else{
                if(flag2){
                    ans[i] = t0 * 3;
                    t0++;
                }else{
                    ans[i] = 3 * t2 + 2;
                    t2++;
                    if(3 * t2 + 2 > N){
                        flag2 = true;
                    }
                }
            }
        }
    }
    rep(i, 0, N){
        if(i != 0) cout << " ";
        cout << ans[i];
    }
    cout << endl;

    
    return 0;
}

Measured memory_bytes: 18176