#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
bool dbg = false;

int N, a[202020], b[202020];
vector<vector<int>> G;
int clr[202020];

itn cnt[3];
void dfs(int idx, itn par, int c) {
    clr[idx] = c;
    cnt[c]++;
    for (auto& nxt : G[idx]) {
        if (nxt == par) {
            continue;
        }
        dfs(nxt, idx, !c);
    }
}
itn check[202020];

void solve() {
    vector<int> num(N, -1);
    dfs(0, -1, 0);
    int MIN = min(cnt[0], cnt[1]);
    if (MIN <= N / 3) {
        int MIN_clr;
        if (cnt[0] < cnt[1])
            MIN_clr = 0;
        else
            MIN_clr = 1;
        int now = 3;
        FOR(N) {
            if (clr[i] == MIN_clr) {
                num[i] = now;
                check[now]++;
                now += 3;
            }
        }
        now = 1;
        FOR(N) {
            if (clr[i] != MIN_clr) {
                while (check[now])
                    now++;
                num[i] = now;
                now++;
            }
        }
    } else {
        int n1 = 1;
        int n2 = 2;
        int n3 = 3;
        FOR(N) {
            if (clr[i] == 1) {
                if (n1 <= N) {
                    num[i] = n1;
                    n1 += 3;
                } else {
                    num[i] = n3;
                    n3 += 3;
                }
            } else {
                if (n2 <= N) {
                    num[i] = n2;
                    n2 += 3;
                } else {
                    num[i] = n3;
                    n3 += 3;
                }
            }
        }
    }
    FOR(N) {
        cout << num[i] << " ";
    }
    cout << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;
    G.resize(N);
    FOR(N - 1) {
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        G[a[i]].eb(b[i]);
        G[b[i]].eb(a[i]);
    }


    solve();
    return 0;
}


Measured memory_bytes: 22528