import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A, B;

int[][] G;
int[] cols;
void dfs(int u, int p, int c) {
  cols[u] = c;
  foreach (v; G[u]) {
    if (v != p) {
      dfs(v, u, c ^ 1);
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      G = new int[][N];
      cols = new int[N];
      cols[] = -1;
      foreach (i; 0 .. N - 1) {
        G[A[i]] ~= B[i];
        G[B[i]] ~= A[i];
      }
      dfs(0, -1, 0);
      debug {
        writeln("cols = ", cols);
      }
      
      auto vals = new DList!int[3];
      foreach (x; 1 .. N + 1) {
        vals[x % 3].insertBack(x);
      }
      auto ans = new int[N];
      foreach (u; 0 .. N) {
        int r = 1 + cols[u];
        if (vals[r].empty) {
          r = 0;
        }
        ans[u] = vals[r].front;
        vals[r].removeFront;
      }
      foreach (u; 0 .. N) {
        if (u > 0) write(" ");
        write(ans[u]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}
