#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

vector<vector<int>> to;
vector<int> color;

void dfs(int now, int prv, int c)
{
    color[now] = c;
    for (auto nxt : to[now]) if (nxt != prv) {
        dfs(nxt, now, !c);
    }
}

void answer(vector<int> ret)
{
    FOR(i, 1, ret.size()) printf("%d ", ret[i]);
    puts("");
    exit(0);
}

int main()
{
    int N;
    cin >> N;
    to.resize(N + 1);
    REP(_, N - 1)
    {
        int a, b;
        cin >> a >> b;
        to[a].push_back(b);
        to[b].push_back(a);
    }

    if (N == 2) {
        vector<int> ret = {0, 1, 2};
        answer(ret);
    }

    int max_deg = 0, star_center = -1;
    REP(i, N + 1) if (mmax(max_deg, (int)to[i].size())) star_center = i;
    if (max_deg == N - 1) {
        // star graph
        vector<int> ret(N + 1);
        iota(ret.begin(), ret.end(), 0);
        int d = ret[star_center];
        if (d % 3) {
            swap(ret[3], ret[star_center]);
            answer(ret);
        }
    }

    color.resize(N + 1, -1);
    dfs(1, 0, 0);
    vector<int> ones, twos, threes;
    FOR(i, 1, N + 1) {
        if (i % 3 == 1) ones.push_back(i);
        if (i % 3 == 2) twos.push_back(i);
        if (i % 3 == 0) threes.push_back(i);
    }

    int n0 = 0, n1 = 0;
    FOR(i, 1, N + 1) {
        if (color[i] == 0) n0++;
        else n1++;
    }

    vector<int> ret(N + 1, -1);

    if (min(n0, n1) <= threes.size()) {
        if (n0 <= threes.size()) {
            FOR(i, 1, N + 1) if (color[i] == 0) {
                ret[i] = threes.back();
                threes.pop_back();
            }
        }
        else {
            FOR(i, 1, N + 1) if (color[i] == 1) {
                ret[i] = threes.back();
                threes.pop_back();
            }
        }

        FOR(i, 1, N + 1) if (ret[i] < 0) {
            if (ones.size())
            {
                ret[i] = ones.back();
                ones.pop_back();
            }
            else if (twos.size())
            {
                ret[i] = twos.back();
                twos.pop_back();
            }
            else {
                ret[i] = threes.back();
                threes.pop_back();
            }
        }
        answer(ret);
    }
    

    REP(_, 2)
    {
        if (n1 >= ones.size() and n1 <= ones.size() + threes.size())
        {
            FOR(i, 1, N + 1) {
                if (color[i] == 1) {
                    if (ones.size()) {
                        ret[i] = ones.back();
                        ones.pop_back();
                    }
                    else {
                        ret[i] = threes.back();
                        threes.pop_back();
                    }
                }
                else {
                    if (twos.size()) {
                        ret[i] = twos.back();
                        twos.pop_back();
                    }
                    else {
                        ret[i] = threes.back();
                        threes.pop_back();
                    }
                }
            }
            answer(ret);
        }
        swap(ones, twos);
    }
    puts("-1");
}


Measured memory_bytes: 19448