//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
const ld EPS = 0.001;
const ld EPS2 = 1e-6;
const ld PI = acos(-1);
int mod = (int)998244353;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const ll kekmod = 1791791791;
const ll bestmod = 1148822869;
vector<vector<int>> g;
vector<int> d;
void dfs(int v, int p)
{
	d[v] = d[p] + 1;
	for (int i : g[v])
	{
		if (i == p) continue;
		dfs(i, v);
	}
}
signed main()
{
	fastio();
	int n;
	cin >> n;
	g.resize(n + 1);
	d.resize(n + 1);
	for (int i = 0; i < n - 1; ++i)
	{
		int a, b;
		cin >> a >> b;
		g[a].pbc(b);
		g[b].pbc(a);
	}
	dfs(1, 1);
	set<int> c1, c2, c3;
	for (int i = 1; i <= n; ++i)
	{
		if (i % 3 == 1) c1.insert(i);
		else if (i % 3 == 2) c2.insert(i);
		else c3.insert(i);
	}
	vector<int> cnt(3);
	for (int i = 1; i <= n; ++i)
	{
		cnt[d[i] % 2] ++;
	}
	vector<int> ans(n + 1);
	if (cnt[0] > cnt[1])
	{
		if (cnt[1] <= c3.size())
		{
			for (int i = 1; i <= n; ++i)
			{
				if (d[i] % 2)
				{
					ans[i] = *c3.begin();
					c3.erase(c3.begin());
				}
				else
				{
					if (c1.size())
					{
						ans[i] = *c1.begin();
						c1.erase(c1.begin());
					}
					else if(c2.size())
					{
						ans[i] = *c2.begin();
						c2.erase(c2.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
			}
		}
		else
		{
			if (c1.size() > c2.size()) swap(c1, c2);
			for (int i = 1; i <= n; ++i)
			{
				if (d[i] % 2)
				{
					if (c1.size())
					{
						ans[i] = *c1.begin();
						c1.erase(c1.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
				else
				{
					if (c2.size())
					{
						ans[i] = *c2.begin();
						c2.erase(c2.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
			}
		}
	}
	else
	{
		if (cnt[0] <= c3.size())
		{
			for (int i = 1; i <= n; ++i)
			{
				if (d[i] % 2 == 0)
				{
					ans[i] = *c3.begin();
					c3.erase(c3.begin());
				}
				else
				{
					if (c1.size())
					{
						ans[i] = *c1.begin();
						c1.erase(c1.begin());
					}
					else if(c2.size())
					{
						ans[i] = *c2.begin();
						c2.erase(c2.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
			}
		}
		else
		{
			if (c1.size() > c2.size()) swap(c1, c2);
			for (int i = 1; i <= n; ++i)
			{
				if (d[i] % 2 == 0)
				{
					if (c1.size())
					{
						ans[i] = *c1.begin();
						c1.erase(c1.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
				else
				{
					if (c2.size())
					{
						ans[i] = *c2.begin();
						c2.erase(c2.begin());
					}
					else
					{
						ans[i] = *c3.begin();
						c3.erase(c3.begin());
					}
				}
			}
		}
	}
	for (int i = 1; i <= n; ++i) cout << ans[i] << ' ';
	sp;
}


Measured memory_bytes: 25336