#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    //二部グラフ判定
    vector<int> color;
    bool is_bipartite(){
        color = vec(N, -1);
        REP(i, N) if(color[i] == -1){
            if(!dfs_for_check_bipartite(i, 0)) return false;
        }
        return true;
    }
    bool dfs_for_check_bipartite(int v, int c){
        if(color[v] != -1){
            if(color[v] == c) return true;
            else return false;
        }
        color[v] = c;
        for(auto e: G[v]) if(!dfs_for_check_bipartite(e.to, (c + e.cost) & 1)) return false;
        return true;
    }

};

signed main(){

    int N; cin >> N;
    Graph G(N);
    REP(i, N - 1){
        int a, b; cin >> a >> b;
        a--; b--;
        G.add_Undirected_edge(a, b);
    }

    G.is_bipartite();
    vec color = G.color;
    
    vec v0, v1;
    REP(i, N){
        if(color[i] == 0) v0.pb(i);
        else v1.pb(i);
    }
    if(SZ(v0) > SZ(v1)){
        v1.swap(v0);
    }

    int n1 = (N + 2) / 3, n2 = (N + 1) / 3, n3 = N / 3;
    vec ans(N);
    int i1 = 0, i2 = 0, i3 = 0;

    if(SZ(v0) <= n3){
        bools used(N + 1, false);
        REP(i, SZ(v0)){
            ans[v0[i]] = 3 * i + 3;
            used[3 * i + 3] = true; 
        }
        int j = 1;
        REP(i, SZ(v1)){
            while(used[j]) j++;
            ans[v1[i]] = j;
            used[j] = true;
        }
    }else{
        REP(i, SZ(v0)){
            if(i1 < n1){
                ans[v0[i]] = 3 * i1 + 1;
                i1++;
            }else{
                ans[v0[i]] = 3 * i3 + 3;
                i3++;
            }
        }
        REP(i, SZ(v1)){
            if(i2 < n2){
                ans[v1[i]] = 3 * i2 + 2;
                i2++;
            }else{
                ans[v1[i]] = 3 * i3 + 3;
                i3++;
            }
        }
    }

    REP(i, N) cout << ans[i] << ' ';
    cout << endl;

    return 0;
}


Measured memory_bytes: 26148