#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

void solve() {
  int N;
  cin >> N;
  vector<vi32> g(N);
  rep(i, N - 1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    g[a].emplace_back(b);
    g[b].emplace_back(a);
  }
  vi32 dist(N);
  auto dfs = [&](auto dfs, int u, int p) -> void {
    for (auto v : g[u]) if (v != p) {
      dist[v] = dist[u] + 1;
      dfs(dfs, v, u);
    }
  };
  dfs(dfs, 0, -1);
  vector<vi32> lst(2);
  rep(i, N) {
    if (dist[i] & 1) {
      lst[1].emplace_back(i);
    } else {
      lst[0].emplace_back(i);
    }
  }
  int n = lst[0].size();
  int m = lst[1].size();
  if (n > m) swap(n, m), swap(lst[0], lst[1]);

  if (n <= N / 3) {
    vi32 ans(N);
    vi32 used(N + 1);
    int x = 3;
    each(l, lst[0]) {
      ans[l] = x;
      used[x] = 1;
      x += 3;
    }
    int num = 1;
    for (int i = 0; i < N; i++) {
      if (ans[i] != 0) continue;
      while (used[num]) num++;
      ans[i] = num;
      used[num] = 1;
    }
    cout << ans << endl;
  } else {
    vi32 ans(N);
    vi32 used(N + 1);
    int x = 1;
    each(l, lst[0]) {
      ans[l] = x;
      used[x] = 1;
      x += 3;
      if (x > N) x = 3;
    }
    int num = 1;
    rep(i, N) {
      if (ans[i] != 0) continue;
      while (used[num]) num++;
      ans[i] = num;
      used[num] = 1;
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 17780