#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int N = 2e5 + 10;

vi g[N];


vi verts[N];
bool used[N];

int c[3];

vi ans[3];

void dfs(int v, int par, int dip) {
    if (!used[v])
        verts[dip].push_back(v);
    for (int to : g[v]) {
        if (to == par)
            continue;
        dfs(to, v, dip + 1);
    }
}

void dfs_ans(int v, int par, int dip, bool kek, int & need, vi & ans) {
    if (!used[v] && (dip & 1) == kek && need) {
        need--;
        ans.push_back(v);
        used[v] = true;
    }
    for (int to : g[v]) {
        if (to == par)
            continue;
        dfs_ans(to, v, dip + 1, kek, need, ans);
    }
}

void smain() {

    int n;
    cin >> n;
    fori (i, n - 1) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }


    for (int i = 1; i <= n; ++i) {
        c[i % 3]++;
    }

    dfs(1, -1, 0);

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

    vi ones;
    int need = c[1];
    dfs_ans(1, -1, 0, odd > even, need,  ones);
    assert(ones.size() == c[1]);
    for (int i = 0; i < n; ++i) {
        verts[i].clear();
    }
    dfs(1, -1, 0);
    even = 0, odd = 0;
    for (int i = 0; i < n; ++i) {
        if (i & 1)
            odd += verts[i].size();
        else
            even += verts[i].size();
    }


    vi twos;
    need = c[2];
    dfs_ans(1, -1, 0, odd > even, need,  twos);
    assert(twos.size() == c[2]);

    vi p(n + 1, 0);
    for (int i = 1, j = 0; i <= n; i += 3, j++) {
        p[ones[j]] = i;
    }
    for (int i = 2, j = 0; i <= n; i += 3, j++) {
        p[twos[j]] = i;
    }
    vi zeros;
    for (int v = 1; v <= n; ++v) {
        if (!used[v])
            zeros.push_back(v);
    }
    for (int i = 3, j = 0; i <= n; i += 3, j++) {
        p[zeros[j]] = i;
    }

    for (int i = 1; i <= n; ++i) {
        cout << p[i] << ' ';
    }
}

Measured memory_bytes: 33532