#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(ll &a, ll b) {
	a = min(a, b);
}
void chmax(int &a, int b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

vector<int> G[1 << 18];
void solve() {
	int n; cin >> n;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	vector<int> col(n);
	queue<int> q; q.push(0);
	vector<bool> used(n, false);
	used[0] = true;
	while (!q.empty()) {
		int v = q.front(); q.pop();
		for (int to : G[v]) {
			if (used[to])continue;
			used[to] = true;
			col[to] = col[v] ^ 1;
			q.push(to);
		}
	}
	int cnt[2] = {};
	rep(i, n)cnt[col[i]]++;
	if (cnt[0] > cnt[1]) {
		rep(i, n)col[i] ^= 1;
		swap(cnt[0], cnt[1]);
	}
	int num[3] = {};
	rep1(i, n)num[i % 3]++;
	if (num[0] >= cnt[0]) {
		vector<int> ans(n, -1);
		vector<bool> used(n + 1, false);
		int cur = 3;
		rep(i, n)if (col[i] == 0) {
			ans[i] = cur;
			used[cur] = true;
			cur += 3;
		}
		cur = 1;
		rep(i, n)if (ans[i] < 0) {
			while (used[cur])cur++;
			ans[i] = cur;
			used[cur] = true;
		}
		rep(i, n) {
			if (i > 0)cout << " ";
			cout << ans[i];
		}
		cout << "\n";
	}
	else {
		vector<int> ans(n, -1);
		vector<int> v0, v1;
		rep(i, n) {
			if (col[i] == 0)v0.push_back(i);
			else v1.push_back(i);
		}
		for (int t = 1; t <= n; t += 3) {
			ans[v0.back()] = t;
			v0.pop_back();
		}
		for (int t = 2; t <= n; t += 3) {
			ans[v1.back()] = t;
			v1.pop_back();
		}
		int cur = 3;
		rep(i, n)if (ans[i] < 0) {
			ans[i] = cur; cur += 3;
		}
		rep(i, n) {
			if (i > 0)cout << " ";
			cout << ans[i];
		}
		cout << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	solve();
	stop
		return 0;
}


Measured memory_bytes: 22512