#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<functional>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, bool> pib;

typedef vector<bool> vb;

typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;

typedef vector<pii> vpii;
typedef vector<vpii> vvpii;

typedef vector<double> vf;

typedef queue<ll> qi;

typedef long double ld;

#define mp make_pair
#define pb push_back

#define rep(i, N) for(ll i = 0; i < N; i++)
#define repa(i, a, N) for(ll i = a; i < N; i++)
#define repr(i, N) for(ll i = N-1; i >= 0; i--)

#define drep(i, N, j, M) rep(i, N) rep(j, M)
#define trep(i, N, j, M, k, L) rep(i, N) rep(j, M) rep(k, L)

#define all(A) A.begin(), A.end()
template<class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
	return os << "{" << p.first << "," << p.second << "}";
}

template<class t>
ostream& operator<<(ostream& os, const vector<t>& v) {
	os << "{";
	for (auto e : v)os << e << ",";
	return os << "}";
}

template<class t, class u>
ostream& operator<<(ostream& os, const unordered_map<t, u>& m) {
	os << "{";
	for (auto itr = m.begin(); itr != m.end(); ++itr) {
		os << "(" << itr->first << ", " << itr->second << "), ";
	}
	return os << "}";
}

template<class t>
ostream& operator<<(ostream& os, const set<t>& m) {
	os << "{";
	for (auto itr = m.begin(); itr != m.end(); ++itr) {
		os << *itr << ", ";
	}
	return os << "}";
}

template<class t>
ostream& operator<<(ostream& os, const multiset<t>& m) {
	os << "{";
	for (auto itr = m.begin(); itr != m.end(); ++itr) {
		os << *itr << ", ";
	}
	return os << "}";
}


const ll LLMAX = numeric_limits<long long>::max() / 3;
const double DMAX = numeric_limits<double>::max() / 3;

const double PI = 3.141592653589793;
//const ll MOD = 1e9 + 7;
const ll MOD = 998244353;

template <std::int_fast64_t Modulus> class modint {
	using i64 = std::int_fast64_t;

public:
	i64 a;

	constexpr modint(const i64 x = 0) noexcept : a(x % Modulus) {}
	constexpr i64 &value() noexcept { return a; }
	constexpr const i64 &value() const noexcept { return a; }
	constexpr modint operator+(const modint rhs) const noexcept {
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const noexcept {
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const noexcept {
		return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const noexcept {
		return modint(*this) /= rhs;
	}
	constexpr modint &operator+=(const modint rhs) noexcept {
		a += rhs.a;
		if (a >= Modulus) {
			a -= Modulus;
		}
		return *this;
	}
	constexpr modint &operator-=(const modint rhs) noexcept {
		if (a < rhs.a) {
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	constexpr modint &operator*=(const modint rhs) noexcept {
		a = a * rhs.a % Modulus;
		return *this;
	}
	constexpr modint &operator/=(modint rhs) noexcept {
		i64 exp = Modulus - 2;
		while (exp) {
			if (exp % 2) {
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
		return *this;
	}
};

template<std::int_fast64_t Modulus>
ostream& operator<<(ostream& os, const modint<Modulus>& m) {
	return os << (m.a + Modulus) % Modulus;
}

typedef modint<MOD> mod;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

ll PowInt(ll a, ll n) {
	ll t = 1;
	rep(i, n) {
		t *= a;
	}
	return t;
}

void No() { cout << "No" << endl; }
void Yes() { cout << "Yes" << endl; }
void NO() { cout << "NO" << endl; }
void YES() { cout << "YES" << endl; }

vector<ll> fac(1e6+1); //n!(mod M)
vector<ll> ifac(1e6+1); //k!^{M-2} (mod 
ll mpow(ll x, ll n) { //x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
	ll ans = 1;
	while (n != 0) {
		if (n & 1) ans = ans * x % MOD;
		x = x * x % MOD;
		n = n >> 1;
	}
	return ans;
}

ll comb(ll a, ll b) { //aCbをmod計算
	if (a == 0 && b == 0)return 1;
	if (a < b || a < 0)return 0;
	ll tmp = ifac[a - b] * ifac[b] % MOD;
	return tmp * fac[a] % MOD;
}

void pre_calc_comb() {
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 1e6; i++) {
		fac[i + 1] = fac[i] * (i + 1) % MOD; // n!(mod M)
		ifac[i + 1] = ifac[i] * mpow(i + 1, MOD - 2) % MOD; // k!^{M-2} (mod M) ←累乗にmpowを採用
	}
}

template <class T> class SegTree {
	int n;
	vector<T> data;
	T def;
	function<T(T, T)> operation;
	function<T(T, T)> update;
	T _query(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l) return def;
		if (a <= l && r <= b)
			return data[k];
		else {
			T c1 = _query(a, b, 2 * k + 1, l, (l + r) / 2);
			T c2 = _query(a, b, 2 * k + 2, (l + r) / 2, r);
			return operation(c1, c2);
		}
	}

public:
	SegTree(size_t _n, T _def, function<T(T, T)> _operation,
		function<T(T, T)> _update)
		: def(_def), operation(_operation), update(_update) {
		n = 1;
		while (n < _n) {
			n *= 2;
		}
		data = vector<T>(2 * n - 1, def);
	}

	void change(int i, T x) {
		i += n - 1;
		data[i] = update(data[i], x);
		while (i > 0) {
			i = (i - 1) / 2;
			data[i] = operation(data[i * 2 + 1], data[i * 2 + 2]);
		}
	}

	T query(int a, int b) {
		return _query(a, b, 0, 0, n);
	}

	T operator[](int i) {
		return data[i + n - 1];
	}
};


/*
SegTree<ll> st(N, LLMAX,
	[](ll a, ll b) {return min(a, b); },
	[](ll d, ll x) {return x; });
// */


ll x;

ll N, M, K;
ll ans;

int main() {
	cin >> N;

	vvi Tree(N, vi(0));

	rep(i, N-1) {
		ll a, b;
		cin >> a >> b;
		a--; b--;
		Tree[a].pb(b);
		Tree[b].pb(a);
	}

	vi Used(N, false);
	vi Depth(N, 0);
	vvi Floor(N, vi(0));

	queue<ll> que;
	que.push(0);

	while (que.empty() == false) {
		ll here = que.front();
		que.pop();
		Used[here] = true;

		Floor[Depth[here]].pb(here);

		for (auto next : Tree[here]) {
			if (Used[next])
				continue;

			Depth[next] = Depth[here] + 1;
			que.push(next);
		}
	}

	ll even = 0, odd = 0;
	for (ll d = 0; d < Floor.size(); d+=2) {
		even += Floor[d].size();
	}
	odd = N - even;

	ll ONE = (N + 2) / 3;
	ll TWO = (N + 1) / 3;
	ll THREE = N / 3;

	ll one = 1;
	ll two = 2;
	ll three = 3;

	vi Ans(N, 0);

	if (odd <= even) {
		if (odd > THREE) {
			// そのまま
			for (ll d = 1; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (two <= N) {
						Ans[o] = two;
						two += 3;
					}
					else {
						Ans[o] = three;
						three += 3;
					}
				}
			}

			for (ll d = 0; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (one <= N) {
						Ans[o] = one;
						one += 3;
					}
					else {
						Ans[o] = three;
						three += 3;
					}
				}
			}
		}
		else {
			for (ll d = 1; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					Ans[o] = three;
					three += 3;
				}
			}

			for (ll d = 0; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (one <= N) {
						Ans[o] = one;
						one += 3;
					}
					else if (two <= N) {
						Ans[o] = two;
						two += 3;
					}
					else{
						Ans[o] = three;
						three += 3;
					}
				}
			}
		}
	}
	else {
		if (even > THREE) {
			// そのまま
			for (ll d = 0; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (two <= N) {
						Ans[o] = two;
						two += 3;
					}
					else {
						Ans[o] = three;
						three += 3;
					}
				}
			}

			for (ll d = 1; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (one <= N) {
						Ans[o] = one;
						one += 3;
					}
					else {
						Ans[o] = three;
						three += 3;
					}
				}
			}
		}
		else {
			// 移し替え
			for (ll d = 0; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					Ans[o] = three;
					three += 3;
				}
			}

			for (ll d = 1; d < Floor.size(); d += 2) {
				for (auto o : Floor[d]) {
					if (one <= N) {
						Ans[o] = one;
						one += 3;
					}
					else if (two <= N) {
						Ans[o] = two;
						two += 3;
					}
					else{
						Ans[o] = three;
						three += 3;
					}
				}
			}
		}
	}

	rep(i, N) {
		cout << Ans[i] << " ";
	}
	cout << endl;

	return 0;
}


Measured memory_bytes: 42984