//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>
  
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 200000 + 239;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-12;
const double pi = atan2(0, -1);
const int ABC = 26;

vector<int> g[N];

vector<int> c1, c2;

void dfs(int u, int par, int c) {
    if (c == 0) {
        c1.push_back(u);
    } else {
        c2.push_back(u);
    }
    for (int v : g[u]) {
        if (v != par) {
            dfs(v, u, c ^ 1);
        }
    }
}

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n;
    cin >> n;
    rep(i, 0, n - 1) {
        int u, v;
        cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(0, -1, 0);
    vector<int> id[3];
    rep(i, 0, n) {
        id[(i + 1) % 3].push_back(i + 1);
    }
    int ans[n];
    if (sz(c1) > sz(c2)) {
        swap(c1, c2);
    }
    if (sz(c1) <= n / 3) {
        for (int x : c1) {
            ans[x] = id[0].back();
            id[0].pop_back();
        }
        for (int x : c2) {
            rep(j, 0, 3) {
                if (sz(id[j]) > 0) {
                    ans[x] = id[j].back();
                    id[j].pop_back();
                    break;
                }
            }
        }
        rep(i, 0, n) {
            cout << ans[i] << " ";
        }
        cout << "\n";
        return 0;
    }
    for (int x : c1) {
        if (sz(id[1]) > 0) {
            ans[x] = id[1].back();
            id[1].pop_back();
        } else {
            ans[x] = id[0].back();
            id[0].pop_back();
        }
    }
    for (int x : c2) {
        if (sz(id[2]) > 0) {
            ans[x] = id[2].back();
            id[2].pop_back();
        } else {
            ans[x] = id[0].back();
            id[0].pop_back();
        }
    }
    rep(i, 0, n) {
        cout << ans[i] << " ";
    }
    cout << "\n";
    return 0;
}

Measured memory_bytes: 21748