/*                         _
                        _ooOoo_
                       o8888888o
                       88" . "88
                       (| -_- |)
                       O\  =  /O
                    ____/`---'\____
                  .'  \\|     |//  `.
                 /  \\|||  :  |||//  \
                /  _||||| -:- |||||_  \
                |   | \\\  -  /'| |   |
                | \_|  `\`---'//  |_/ |
                \  .-\__ `-. -'__/-.  /
              ___`. .'  /--.--\  `. .'___
           ."" '<  `.___\_<|>_/___.' _> \"".
          | | :  `- \`. ;`. _/; .'/ /  .' ; |
          \  \ `-.   \_\_`. _.'_/_/  -' _.' /
===========`-.`___`-.__\ \___  /__.-'_.'_.-'================

                  Please give me AC.
*/

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <string>
#include <sstream>
#include <complex>
#include <bitset>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <chrono>
#include <random>

using namespace std;

using int64 = long long;
using uint64 = unsigned long long;
using vi = vector<int>;
using vl = vector<int64>;
using pii = pair<int, int>;
using pll = pair<int64, int64>;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x) cout << (x) << '\n'
#define print2(x, y) cout << (x) << ' ' << (y) << '\n'
#define print3(x, y, z) cout << (x) << ' ' << (y) << ' ' << (z) << '\n'
#define printn(v) rep(i, (v).size() - 1) cout << (v)[i] << ' '; cout << (v)[n - 1] << '\n';
#define debug(x) cerr << #x << ": " << (x) << '\n'
#define debug2(x, y) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << '\n'
#define debug3(x, y, z) cerr << #x << ": " << (x) << ", " << #y << ": " << (y) << ", " << #z << ": " << (z) << '\n'
#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){cerr << #v << "[" << _ << "] : " << v[_] << '\n';}
// constant
const int INF = (1<<30) - 1;
const int64 INF64 = (1LL<<62) - 1;

template<typename T> T gcd(T a, T b) {
    if (a < b) return gcd(b, a);
    T r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

template<typename T> T lcm(const T a, const T b) {
    return a / gcd(a, b) * b;
}

template<typename T> bool chmin(T& a, const T& b) {
    if (a > b) return a = b, true; else return false;
}

template<typename T> bool chmax(T& a, const T& b) {
    if (a < b) return a = b, true; else return false;
}

// End of template.

vector<int> v[200200];
bool visited[200200] = {};
int d[200200] = {};
int ans[200200] = {};

int main() {
    cout << fixed << setprecision(15);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    // cin.read(buf, sizeof buf); // 注意: ./a.out < in か pbp | ./a.out で入力すること

    int n;
    cin >> n;
    rep(i, n - 1) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }


    int kisuu = 0, guusuu = 0;
    queue<int> bfs;
    bfs.push(0);
    d[0] = 0;
    guusuu += 1;
    while (!bfs.empty()) {
        int i = bfs.front();
        bfs.pop();
        visited[i] = true;

        for (auto j : v[i]) if (!visited[j]) {
            d[j] = d[i] + 1;
            if (d[j] & 1) kisuu += 1; else guusuu += 1;
            bfs.push(j);
        }
    }

    int n0 = n / 3, n1 = (n + 2) / 3, n2 = (n + 1) / 3;
    // assert(n2 <= n1 <= n0);
    if (kisuu <= n0 || guusuu <= n0) {
        if (kisuu <= n0) rep(i, n) if (d[i] & 1) ans[i] = 3 * n0--;
        if (guusuu <= n0) rep(i, n) if (d[i] & 1 ^ 1) ans[i] = 3 * n0--;
        rep(i, n) if (ans[i] == 0) {
            if (n0) ans[i] = 3 * n0--;
            else if (n1) ans[i] = 3 * n1-- - 2;
            else if (n2) ans[i] = 3 * n2-- - 1;
        }
    } else {
        rep(i, n) if (d[i] & 1) {
            if (n1) ans[i] = 3 * n1-- - 2;
            else ans[i] = 3 * n0--;
        } else {
            if (n2) ans[i] = 3* n2-- - 1;
            else ans[i] = 3 * n0--;
        }
    }

    rep(i, n - 1) cout << ans[i] << ' '; cout << ans[n - 1] << '\n';

    return 0;
}



Measured memory_bytes: 15600