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

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;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;

void dfs(const auto& G, int v, int p, int d, auto& s) {
    s[d].push_back(v);

    for (int u : G[v]) {
        if (u == p) continue;
        dfs(G, u, v, d+1, s);
    }
}

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

    int N; cin >> N;
    vector<vector<int>> G(N);
    for (int i = 0; i < N-1; ++i) {
        int a, b; cin >> a >> b; --a, --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    vector<vector<int>> s(N);
    dfs(G, 0, -1, 0, s);

    int odd = 0, even = 0;
    for (int i = 0; i < N; ++i) {
        if (i & 1) {
            odd += s[i].size();
        } else {
            even += s[i].size();
        }
    }

    int p = (N+2)/3, q = (N+1)/3;
    int P = 1, Q = 2;

    vector<int> ans(N);

    if (odd < even)
    {
        if (odd >= q)
        {
            for (int i = 1; i < N && q > 0; i += 2) {
                for (int v : s[i]) {
                    ans[v] = Q;
                    --q; Q += 3;
                    if (q == 0) break;
                }
            }
            for (int i = 0; i < N && p > 0; i += 2) {
                for (int v : s[i]) {
                    ans[v] = P;
                    --p; P += 3;
                    if (p == 0) break;
                }
            }
        }
        else
        {
            for (int i = 0; i < N && (p > 0 || q > 0); i += 2) {
                for (int v : s[i]) {
                    if (p > 0) {
                        ans[v] = P;
                        --p; P += 3;
                    } else if (q > 0) {
                        ans[v] = Q;
                        --q; Q += 3;
                    }
                    if (p == 0 && q == 0) {
                        break;
                    }
                }
            }
        }
    }
    else
    {
        if (even >= q)
        {
            for (int i = 0; i < N && q > 0; i += 2) {
                for (int v : s[i]) {
                    ans[v] = Q;
                    --q; Q += 3;
                    if (q == 0) break;
                }
            }
            for (int i = 1; i < N && p > 0; i += 2) {
                for (int v : s[i]) {
                    ans[v] = P;
                    --p; P += 3;
                    if (p == 0) break;
                }
            }
        }
        else
        {
            for (int i = 1; i < N && (p > 0 || q > 0); i += 2) {
                for (int v : s[i]) {
                    if (p > 0) {
                        ans[v] = P;
                        --p; P += 3;
                    } else if (q > 0) {
                        ans[v] = Q;
                        --q; Q += 3;
                    }
                    if (p == 0 && q == 0) {
                        break;
                    }
                }
            }
        }
    }

    int R = 3;
    for (int i = 0; i < N; ++i) {
        if (ans[i] == 0) {
            ans[i] = R;
            R += 3;
        }
    }

    for (int v : ans) {
        cout << v << " ";
    }
    cout << endl;

    return 0;
}


Measured memory_bytes: 30464