#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans[ohara], a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
V g[ohara];
queue<ll> que0, que1, que2;
bool vi[ohara];
ll dep[ohara];

void dfs(ll now, ll now_dep) {
  if (vi[now]) return;
  vi[now] = true;
  dep[now] = now_dep;
  rep(i, Size(g[now])) {
    ll to = g[now][i];
    dfs(to, now_dep + 1);
  }
}

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  rep(i, n - 1) {
    cin >> a >> b;
    a--;
    b--;
    g[a].p_b(b);
    g[b].p_b(a);
  }
  rrep(i, 1, n + 1) {
    if (i % 3 == 0)
      que0.push(i);
    else if (i % 3 == 1)
      que1.push(i);
    else
      que2.push(i);
  }
  dfs(0LL, 0LL);
  rep(i, n) {
    if (dep[i] % 2 == 0) cnt++;
  }
  if (cnt <= n / 3) {
    rep(i, n) {
      if (dep[i] % 2 == 0) {
        ans[i] = que0.front();
        que0.pop();
      } else {
        if (!que1.empty())
          ans[i] = que1.front(), que1.pop();
        else if (!que2.empty())
          ans[i] = que2.front(), que2.pop();
        else if (!que0.empty())
          ans[i] = que0.front(), que0.pop();
      }
    }
  } else if (n - cnt <= n / 3) {
    rep(i, n) {
      if (dep[i] % 2 == 1) {
        ans[i] = que0.front();
        que0.pop();
      } else {
        if (!que1.empty())
          ans[i] = que1.front(), que1.pop();
        else if (!que2.empty())
          ans[i] = que2.front(), que2.pop();
        else if (!que0.empty())
          ans[i] = que0.front(), que0.pop();
      }
    }
  } else {
    rep(i, n) {
      if (dep[i] % 2 == 1) {
        if (!que1.empty())
          ans[i] = que1.front(), que1.pop();
        else if (!que0.empty())
          ans[i] = que0.front(), que0.pop();
      } else {
        if (!que2.empty())
          ans[i] = que2.front(), que2.pop();
        else if (!que0.empty())
          ans[i] = que0.front(), que0.pop();
      }
    }
  }

  rep(i, n) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}

Measured memory_bytes: 44288