#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using loop = int;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(loop (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(loop (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(loop (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(loop (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

void dfs(vector<VI>& g, VI& dis, int now, int par) {
    each(to, g[now]) {
        if (to == par)continue;
        dis[to] = dis[now] + 1;
        dfs(g, dis, to, now);
    }
}

int main() {
    init();

    int n; cin >> n;
    vector<VI> g(n);
    FOR(i, 0, n - 1) {
        int a, b; cin >> a >> b;
        --a, --b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    VI dis(n);
    dfs(g, dis, 0, -1);
    int ev = 0, od = 0;
    FOR(i, 0, n) {
        if (dis[i] % 2 == 0)++ev;
        else ++od;
    }

    VI x, y, z;
    eFOR(i, 1, n) {
        if (i % 3 == 1)x.push_back(i);
        else if (i % 3 == 2)y.push_back(i);
        else z.push_back(i);
    }

    VI ans(n), even, odd;
    if (ev <= n / 3) {
        while (even.size() < ev) {
            even.push_back(z.back());
            z.pop_back();
        }
        while (!x.empty()) {
            odd.push_back(x.back());
            x.pop_back();
        }
        while (!y.empty()) {
            odd.push_back(y.back());
            y.pop_back();
        }
        while (!z.empty()) {
            odd.push_back(z.back());
            z.pop_back();
        }
    }
    else if (od <= n / 3) {
        while (odd.size() < od) {
            odd.push_back(z.back());
            z.pop_back();
        }
        while (!x.empty()) {
            even.push_back(x.back());
            x.pop_back();
        }
        while (!y.empty()) {
            even.push_back(y.back());
            y.pop_back();
        }
        while (!z.empty()) {
            even.push_back(z.back());
            z.pop_back();
        }
    }
    else {
        even = x, odd = y;
        while (even.size() < ev) {
            even.push_back(z.back());
            z.pop_back();
        }
        while (odd.size() < od) {
            odd.push_back(z.back());
            z.pop_back();
        }
    }

    FOR(i, 0, n) {
        if (dis[i] % 2 == 0) {
            ans[i] = even.back();
            even.pop_back();
        }
        else {
            ans[i] = odd.back();
            odd.pop_back();
        }
    }

    FOR(i, 0, n)cout << ans[i] << ENDL(i, n);
}

Measured memory_bytes: 24112