#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18+18;
const ll MAX = 100005;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a, b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n, arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define dbgmint(n, arr) rep(i,n){cerr<<arr[i].x<<" ";}cerr<<endl;
#define dbgarrmint(n, m, arr) rep(i,n){rep(j,m){cerr<<arr[i][j].x<<" ";}cerr<<endl;}
#else
#define dbg(...)
#define dbgmap(...)
#define dbgarr(...)
#define dbgdp(...)
#define dbgmint(...)
#define dbgarrmint(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a, b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

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

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

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>
istream &operator>>(istream &i, vector<T> &v) {
    rep(j, v.size())i>>v[j];
    return i;
}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len = v.size();
    for(int i = 0; i < len; ++i) {
        s<<v[i];
        if(i < len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len = vv.size();
    for(int i = 0; i < len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}


//mint
struct mint {
    ll x; // typedef long long ll;
    mint(ll x = 0) : x((x%MOD+MOD)%MOD) {}

    mint &operator+=(const mint a) {
        if((x += a.x) >= MOD) x -= MOD;
        return *this;
    }

    mint &operator-=(const mint a) {
        if((x += MOD-a.x) >= MOD) x -= MOD;
        return *this;
    }

    mint &operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }

    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }

    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }

    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }

    mint pow(ll t) const {
        if(!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if(t & 1) a *= *this;
        return a;
    }

    // for prime MOD
    mint inv() const {
        return pow(MOD-2);
    }

    mint &operator/=(const mint a) {
        return (*this) *= a.inv();
    }

    mint operator/(const mint a) const {
        mint res(*this);
        return res /= a;
    }
};

struct combination {
    vector<mint> fact, ifact;

    combination(int n) : fact(n+1), ifact(n+1) {
        assert(n < MOD);
        fact[0] = 1;
        for(int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for(int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
    }

    mint operator()(int n, int k) {
        if(k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
    }
};

//LCA
template<typename G>
struct DoublingLowestCommonAncestor {
    const int LOG;
    vector<int> dep;
    const G &g;
    vector<vector<int> > table;

    DoublingLowestCommonAncestor(const G &g) : g(g), dep(g.size()), LOG(32-__builtin_clz(g.size())) {
        table.assign(LOG, vector<int>(g.size(), -1));
    }

    void dfs(int idx, int par, int d) {
        table[0][idx] = par;
        dep[idx] = d;
        for(auto &to : g[idx]) {
            if(to != par) dfs(to, idx, d+1);
        }
    }

    void build(int root) {
        dfs(root, -1, 0);
        for(int k = 0; k+1 < LOG; k++) {
            for(int i = 0; i < table[k].size(); i++) {
                if(table[k][i] == -1) table[k+1][i] = -1;
                else table[k+1][i] = table[k][table[k][i]];
            }
        }
    }

    int query(int u, int v) {
        if(dep[u] > dep[v]) swap(u, v);
        for(int i = LOG-1; i >= 0; i--) {
            if(((dep[v]-dep[u])>>i) & 1) v = table[i][v];
        }
        if(u == v) return u;
        for(int i = LOG-1; i >= 0; i--) {
            if(table[i][u] != table[i][v]) {
                u = table[i][u];
                v = table[i][v];
            }
        }
        return table[0][u];
    }
};


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

    ll n;
    cin>>n;
    VV g(n);
    rep(i, n-1) {
        ll a, b;
        cin>>a>>b;
        a--;
        b--;
        g[a].pb(b);
        g[b].pb(a);
    }

    Vec d(n);
    auto dfs = [&](auto dfs, ll v, ll parent)->void {
        Each(x, g[v]) {
            if(x != parent) {
                d[x] = (d[v]+1)%2;
                dfs(dfs, x, v);
            }
        }
    };
    dfs(dfs, 0, -1);
    VV dtoi(2);
    rep(i, n) {
        dtoi[d[i]].pb(i);
    }
    Vec ord0;
    Vec ord1;
    Vec ord2;
    REP(i, 1, n+1) {
        if(i%3 == 1) {
            ord1.pb(i);
        }
    }
    REP(i, 1, n+1) {
        if(i%3 == 2) {
            ord2.pb(i);
        }
    }
    REP(i, 1, n+1) {
        if(i%3 == 0) {
            ord0.pb(i);
        }
    }

    Vec ans(n);

    ll ord1cnt = 0;
    ll ord2cnt = 0;
    ll ord0cnt = 0;

    if(dtoi[0].size() <= n/3) {
        rep(i, dtoi[0].size()) {
            ans[dtoi[0][i]] = ord0[ord0cnt];
            ord0cnt++;
        }
        rep(i, dtoi[1].size()) {
            if(ord1cnt < ord1.size()) {
                ans[dtoi[1][i]] = ord1[ord1cnt];
                ord1cnt++;
            } else if(ord2cnt < ord2.size()) {
                ans[dtoi[1][i]] = ord2[ord2cnt];
                ord2cnt++;
            } else {
                ans[dtoi[1][i]] = ord0[ord0cnt];
                ord0cnt++;
            }
        }
    } else if(dtoi[1].size() <= n/3) {
        rep(i, dtoi[1].size()) {
            ans[dtoi[1][i]] = ord0[ord0cnt];
            ord0cnt++;
        }
        rep(i, dtoi[0].size()) {
            if(ord1cnt < ord1.size()) {
                ans[dtoi[0][i]] = ord1[ord1cnt];
                ord1cnt++;
            } else if(ord2cnt < ord2.size()) {
                ans[dtoi[0][i]] = ord2[ord2cnt];
                ord2cnt++;
            } else {
                ans[dtoi[0][i]] = ord0[ord0cnt];
                ord0cnt++;
            }
        }
    } else {
        rep(i, dtoi[1].size()) {
            if(ord1cnt < ord1.size()) {
                ans[dtoi[1][i]] = ord1[ord1cnt];
                ord1cnt++;
            } else {
                ans[dtoi[1][i]] = ord0[ord0cnt];
                ord0cnt++;
            }
        }
        rep(i, dtoi[0].size()) {
            if(ord2cnt < ord2.size()) {
                ans[dtoi[0][i]] = ord2[ord2cnt];
                ord2cnt++;
            } else {
                ans[dtoi[0][i]] = ord0[ord0cnt];
                ord0cnt++;
            }
        }
    }
    assert(ord0cnt+ord1cnt+ord2cnt == n);

    vout(ans);
    return 0;
}


Measured memory_bytes: 21864