#include <bits/stdc++.h>

using namespace std;

#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)

constexpr int MOD = 1000000007;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template <class T>
string to_string(T s);
template <class S, class T>
string to_string(pair<S, T> p);
string to_string(string s) { return s; }
string to_string(const char s[]) { return to_string(string(s)); }

template <class T>
string to_string(T v) {
  if (v.empty()) return "{}";
  string ret = "{";
  for (auto x : v) ret += to_string(x) + ",";
  ret.back() = '}';
  return ret;
}
template <class S, class T>
string to_string(pair<S, T> p) {
  return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}

void debug() { cerr << endl; }
template <class Head, class... Tail>
void debug(Head head, Tail... tail) {
  cerr << to_string(head) << " ";
  debug(tail...);
}

struct IO {
#ifdef _WIN32
  inline char getchar_unlocked() { return getchar(); }
  inline void putchar_unlocked(char c) { putchar(c); }
#endif
  string separator = " ";
  template <class T>
  inline void read(T& x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c != '-' && (c < '0' || '9' < c));
    bool minus = 0;
    if (c == '-') {
      minus = 1;
      c = getchar_unlocked();
    }
    x = 0;
    while ('0' <= c && c <= '9') {
      x *= 10;
      x += c - '0';
      c = getchar_unlocked();
    }
    if (minus) x = -x;
  }
  inline void read(string& x) {
    char c;
    do {
      c = getchar_unlocked();
    } while (c == ' ' || c == '\n');
    x.clear();
    do {
      x += c;
      c = getchar_unlocked();
    } while (c != ' ' && c != '\n' && c != EOF);
  }
  template <class T>
  inline void read(vector<T>& v) {
    for (auto& x : v) read(x);
  }
  template <class Head, class... Tail>
  inline void read(Head& head, Tail&... tail) {
    read(head);
    read(tail...);
  }
  template <class T>
  inline void write(T x) {
    char buf[32];
    int p = 0;
    if (x < 0) {
      x = -x;
      putchar_unlocked('-');
    }
    if (x == 0) putchar_unlocked('0');
    while (x > 0) {
      buf[p++] = (x % 10) + '0';
      x /= 10;
    }
    while (p) {
      putchar_unlocked(buf[--p]);
    }
  }
  inline void write(string x) {
    for (char c : x) putchar_unlocked(c);
  }
  inline void write(const char s[]) {
    for (int i = 0; s[i] != 0; ++i) putchar_unlocked(s[i]);
  }
  template <class T>
  inline void write(vector<T> v) {
    for (auto itr = v.begin(); itr + 1 != v.end(); ++itr) {
      write(*itr);
      write(separator);
    }
    write(v.back());
  }
  template <class Head, class... Tail>
  inline void write(Head head, Tail... tail) {
    write(head);
    write(separator);
    write(tail...);
  }
  template <class Head, class... Tail>
  inline void writeln(Head head, Tail... tail) {
    write(head, tail...);
    write("\n");
  }
  void set_separator(string s) { separator = s; }
} io;

int main() {
  int N;
  io.read(N);
  vector<vector<int>> G(N);
  REP(i, N - 1) {
    int a, b;
    io.read(a, b);
    G[a - 1].push_back(b - 1);
    G[b - 1].push_back(a - 1);
  }
  vector<int> color(N, -1);
  function<void(int)> dfs = [&](int u) {
    for (auto v : G[u]) {
      if (color[v] == -1) {
        color[v] = 3 - color[u];
        dfs(v);
      }
    }
  };
  color[0] = 1;
  dfs(0);
  int cnt[3] = {};
  REP(i, N) cnt[color[i]]++;
  set<int> mods[3];
  FOR(i, 1, N + 1) mods[i % 3].insert(i);
  vector<int> p(N);
  int three = N / 3;
  if (cnt[1] - cnt[2] > three) {
    REP(i, N) {
      if (color[i] == 2) {
        p[i] = *mods[0].begin();
        mods[0].erase(p[i]);
      } else {
        if (!mods[1].empty()) {
          p[i] = *mods[1].begin();
          mods[1].erase(p[i]);
        } else if (!mods[2].empty()) {
          p[i] = *mods[2].begin();
          mods[2].erase(p[i]);
        } else {
          p[i] = *mods[0].begin();
          mods[0].erase(p[i]);
        }
      }
    }
  } else if (cnt[2] - cnt[1] > three) {
    REP(i, N) {
      if (color[i] == 1) {
        p[i] = *mods[0].begin();
        mods[0].erase(p[i]);
      } else {
        if (!mods[1].empty()) {
          p[i] = *mods[1].begin();
          mods[1].erase(p[i]);
        } else if (!mods[2].empty()) {
          p[i] = *mods[2].begin();
          mods[2].erase(p[i]);
        } else {
          p[i] = *mods[0].begin();
          mods[0].erase(p[i]);
        }
      }
    }
  } else {
    REP(i, N) {
      if (mods[color[i]].empty()) {
        p[i] = *mods[0].begin();
        mods[0].erase(p[i]);
      } else {
        p[i] = *mods[color[i]].begin();
        mods[color[i]].erase(p[i]);
      }
    }
  }
  REP(i, 3) { assert(mods[i].empty()); }
  io.writeln(p);
  return 0;
}

Measured memory_bytes: 27520