#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

const int N = 2 * (int)1e5;
vector<int> conns[N];
int side[N];
int cou[N];

void dfs(int i, int p) {
	side[i] = 1 ^ side[p];
	++cou[side[i]];
	for (auto t : conns[i]) if (t != p) dfs(t, i);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;
	for (int i = 0; i < n-1; ++i) {
		int a, b;
		cin >> a >> b;
		--a; --b;
		conns[a].push_back(b);
		conns[b].push_back(a);
	}
	dfs(0, 0);

	int t1 = (n+2) / 3;
	int s1 = (cou[1] > cou[0]);
	cou[s1] -= t1;

	int t2 = (n+1) / 3;
	int s2 = (cou[1] > cou[0]);
	cou[s2] -= t2;

	if (cou[s1] < 0 || cou[s2] < 0) cout << -1 << '\n';
	else {
		vector<int> inds = {3, 1, 2};
		for (int i = 0; i < n; ++i) {
			if (side[i] == s1 && inds[1] <= n) {
				cout << inds[1] << ' ';
				inds[1] += 3;
			} else if (side[i] == s2 && inds[2] <= n) {
				cout << inds[2] << ' ';
				inds[2] += 3;
			} else {
				cout << inds[0] << ' ';
				inds[0] += 3;
			}
		}
		cout << '\n';
	}
}
