#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
ll mod = 998244353;
// ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
bool multicase = false;

ll n,m,num,sum,a,b,c,d,e,h,q,p;
ll w, ans;
ll k;
ll x[500005], y[500005];
vector<ll> print;
char s[500005], t[500005];
vector<ll> G[500005];

void dfs(ll v, ll c,ll p){
    x[v] = c;
    for(ll i=0;i<G[v].size();i++){
        ll nv = G[v][i];
        if(nv == p)continue;
        dfs(nv, 3 - c, v);
    }
}
void solve(){
    cin >> n;
    for(ll i=0;i<n-1;i++){
        cin >> a >> b;
        G[a].pb(b);
        G[b].pb(a);
    }
    dfs(1, 1, -1);
    ll one_c = 0, two_c = 0;
    ll one_p = 0, two_p = 0;
    for(ll i=1;i<=n;i++){
        if(x[i] == 1)one_c++;
        if(x[i] == 2)two_c++;
        if(i % 3 == 1)one_p++;
        if(i % 3 == 2)two_p++;
    }
    vector<ll> one, two, three;
    for(ll i=1;i<=n;i++){
        if(i % 3 == 1)one.pb(i);
        if(i % 3 == 2)two.pb(i);
        if(i % 3 == 0)three.pb(i);
    }
    ll three_p = n - one_p - two_p;
    ll aim_c;
    if(one_c > one_p + three_p){
        // 1が多すぎるので、2に全部3を割り当てても問題ない
        aim_c = 1;   
    }else if(two_c > two_p + three_p){
        aim_c = 2;
    }else{
        ll one = 1, two = 2, three = 3;
        for(ll i=1;i<=n;i++){
            if(x[i] == 1){
                if(one > n){
                    pe(three);
                    three += 3;
                }else{
                    pe(one);
                    one += 3;
                }
            }else{
                if(two > n){
                    pe(three);
                    three += 3;
                }else{
                    pe(two);
                    two += 3;
                }
            }
        }
        el;
        return;
    }   
    for(ll i=1;i<=n;i++){
        if(x[i] == aim_c){
            if(!one.empty()){
                print.pb(one.back());
                one.pop_back();
            }else if(!two.empty()){
                print.pb(two.back());
                two.pop_back();
            }else{
                print.pb(three.back());
                three.pop_back();
            }
        }else{
            print.pb(three.back());
            three.pop_back();
        }
    }
    for(ll i=0;i<print.size();i++){
        pe(print[i]);
    }
    el;
    
    return;
}

int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q;
    if(multicase){
        cin >> q;
    }else{
        q = 1;
    }
    while(q--){
        solve();
    }
    return 0;

}


















Measured memory_bytes: 33388