#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = (int)(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = (int)(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << '\n'
#define endl '\n'

constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-10;

constexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
constexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

template<typename T>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T& a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

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

    int n;
    cin >> n;

    vector< vector<int> > g(n);
    rep(i, n - 1){
        int a, b;
        cin >> a >> b;
        g[--a].emplace_back(--b);
        g[b].emplace_back(a);
    }

    vector<int> cost(n, IINF);
    cost[0] = 0;
    queue< P > que;
    que.push({0, 0});

    while(!que.empty()){
        P now = que.front();
        que.pop();
        if(cost[now.first] < now.second){
            continue;
        }
        for(auto to : g[now.first]){
            if(chmin(cost[to], now.second + 1)){
                que.push({to, now.second + 1});
            }
        }
    }

    vector<int> cnt(2, 0);
    rep(i, n){
        ++cnt[cost[i] & 1];
    }

    vector<int> ans(n, 0);
    int one = 1;
    int two = 2;
    int zero = 3;

    if(cnt[0] <= n / 3){
        rep(i, n){
            if(cost[i] & 1){
                if(one <= n){
                    ans[i] = one;
                    one += 3;
                }else if(two <= n){
                    ans[i] = two;
                    two += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }else{
                ans[i] = zero;
                zero += 3;
            }
        }
    }else if(cnt[1] <= n / 3){
        rep(i, n){
            if(!(cost[i] & 1)){
                if(one <= n){
                    ans[i] = one;
                    one += 3;
                }else if(two <= n){
                    ans[i] = two;
                    two += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }else{
                ans[i] = zero;
                zero += 3;
            }
        }
    }else if(cnt[0] < cnt[1]){
        rep(i, n){
            if(cost[i] & 1){
                if(one <= n){
                    ans[i] = one;
                    one += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }else{
                if(two <= n){
                    ans[i] = two;
                    two += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }
        }
    }else{
        rep(i, n){
            if(!(cost[i] & 1)){
                if(one <= n){
                    ans[i] = one;
                    one += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }else{
                if(two <= n){
                    ans[i] = two;
                    two += 3;
                }else{
                    ans[i] = zero;
                    zero += 3;
                }
            }
        }
    }

    rep(i, n){
        if(i) cout << ' ';
        cout << ans[i];
    }
    cout << endl;

    cout << flush;

    return 0;
}

Measured memory_bytes: 15984