#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v)                              \
    for (int64_t i = 0; i < (v).size(); ++i) \
    {                                        \
        cout << v.at(i) << endl;             \
    }
#define REP(i, n) for (int64_t i = 0; i < n; ++i)
#define FOR(i, r, n) for (int64_t i = (r); i < n; ++i)
#define VIN(v)                               \
    for (int64_t i = 0; i < (v).size(); ++i) \
    {                                        \
        cin >> (v).at(i);                    \
    }

typedef vector<bool> bvec;
typedef vector<int> ivec;
typedef vector<long long> lvec;
typedef vector<double> dvec;
typedef vector<pa> pavec;
typedef vector<pali> palivec;
typedef vector<pal> palvec;

typedef vector<vector<bool> > bmat;
typedef vector<vector<int> > imat;
typedef vector<vector<long long> > lmat;

typedef vector<string> svec;
typedef vector<vector<string> > smat;
const ll infll = (1LL << 60) - 1;
const int inf = (1 << 30) - 1;
const int MOD = 1000000007;

ll gcd(ll x, ll y)
{
    ll r = x % y;
    if (r == 0)
        return y;
    else
        return gcd(y, r);
}

ll lcm(ll x, ll y)
{
    return x * y / gcd(x, y);
}

lvec mfactor(ll n)
{
    bvec ip(n, true);
    lvec mf(n, -1);
    ip[0] = false;
    ip[1] = false;
    mf[0] = 0;
    mf[1] = 1;
    REP(i, n)
    {
        if (ip[i])
        {
            mf[i] = i;
            for (ll j = i * i; j < n; j += i)
            {
                ip[j] = false;
                if (mf[j] == -1)
                    mf[j] = i;
            }
        }
    }
    return mf;
}

palivec get_prime(ll n, const lvec &mf)
{
    palivec plist;
    while (n != 1)
    {
        int cnt = 0;
        ll m = mf[n];
        while (mf[n] == m)
        {
            cnt++;
            n /= m;
        }
        plist.pb(pali(m, cnt));
    }
    return plist;
}

void COMinit(int m, lvec &fac, lvec &finv)
{
    lvec inv(m);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < m; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll pow_mod(ll a, ll n)
{
    ll x = 1;
    while (n > 0)
    {
        if (n & 1)
        {
            x = x * a % MOD;
        }
        a = a * a % MOD;
        n >>= 1;
    }
    return x;
}
ll COM(int n, int k, const lvec &fac, const lvec &finv)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll modinv(ll a, ll m)
{
    ll b = m, u = 1, v = 0;
    while (b)
    {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

ll P(ll n, ll m)
{
    ll s = 1;
    ll cnt = n;
    REP(i, n - m)
    {
        s *= cnt % MOD;
        s %= MOD;
        --cnt;
    }
    return s;
}

void fac(int a, int b, bvec &fmap){
        for (int i=2; i<b; i++){
            if(fmap[i]) continue;
            else if(a%i==0) {
                fmap[i] = true;
                int n=a/i, x=i;
                while(n>=i){
                    n/=i;
                    x+=i;
                    fmap[x]=true;
                }
            }
        }
}

void bfs(int ind, const imat &g, imat &cl){
    int n = g.size();
    bvec u(n, false);
    queue<pa> q;
    q.push(pa(ind, 0));
    while(!q.empty()){
        pa ii = q.front();
        q.pop();
        int i=ii.first;
        int cnt = ii.second;
        u[i] = true;
        if(cnt%2) cl[1].pb(i);
        else cl[0].pb(i);
        for(auto &v: g[i]){
            if(!u[v]) q.push(pa(v, cnt+1));
        }
    }
}


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    imat g(n), cl(2), f(3);
    ivec ans(n, -1);
    for (int i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        g[a-1].pb(b-1);
        g[b-1].pb(a-1);
    }
    int k=0;
    for (int i=0; i<n/3; i++){
        f[1].pb(k+1);
        f[2].pb(k+2);
        f[0].pb(k+3);
        k+=3;
    }
    int r = n%3;
    if(r>=1){
        f[1].pb(k+1);
        if(r==2) f[2].pb(k+2);
    }


    //COUT(f[1]);
    //COUT(f[2]);
    //COUT(f[0]);
    
    bfs(0, g, cl);
    int n0 = cl[0].size(), n1 = cl[1].size();
    if(n0 > n/3 && n1 > n/3){
        int c = n0 < n1 ? 0 : 1;
        int sn = min(n0, n1), ln = max(n0, n1);
        int j=0;
        for (int i=0; i<f[1].size(); i++) {
            ans[cl[c][i]] = f[1][i];
            j++;
        }

        for (int i=0; i<f[0].size(); i++) {
            if(j<sn) ans[cl[c][j]] = f[0][i];
            else {
                ans[cl[!c][j-sn]] = f[0][i];
            }
            j++;
        }
        for (int i=0; i<f[2].size(); i++) {            
            ans[cl[!c][j-sn]] = f[2][i];            
            j++;
        }
    }
    else{
        int c = n0 < n1 ? 0 : 1;
        int sn = min(n0, n1), ln = max(n0, n1);
        for (int i=0; i<sn; i++) ans[cl[c][i]] = f[0][i];
        for (int i=0; i<ln; i++){
            int ii = sn + i;
            if(ii < n/3) ans[cl[!c][i]] = f[0][ii];
            else if (ii - n/3 < f[1].size()){
                ans[cl[!c][i]] = f[1][ii-n/3];
            }
            else {
                ans[cl[!c][i]] = f[2][ii-n/3-f[1].size()];
            }
        }
    }

    for (int i=0; i<n; i++){
        cout << ans[i] << ' ';
    }
    cout << endl;
}

Measured memory_bytes: 17520