#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
  static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
  (*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );
  (*arr)=(T*)(*mem);
  (*mem)=((*arr)+x);
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
struct graph{
  int N;
  int *es;
  int **edge;
  void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
    int i;
    N = N__;
    walloc1d(&es, N, mem);
    walloc1d(&edge, N, mem);
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      es[A[i]]++;
      es[B[i]]++;
    }
    for(i=(0);i<(N);i++){
      walloc1d(&edge[i], es[i], mem);
    }
    for(i=(0);i<(N);i++){
      es[i] = 0;
    }
    for(i=(0);i<(M);i++){
      edge[A[i]][es[A[i]]++] = B[i];
      edge[B[i]][es[B[i]]++] = A[i];
    }
  }
  void getDist(int root, int res[], void *mem = wmem){
    int i;
    int j;
    int k;
    int*q;
    int s;
    int z;
    walloc1d(&q, N, &mem);
    for(i=(0);i<(N);i++){
      res[i]=-1;
    }
    res[root]=0;
    s=0;
    z=1;
    q[0]=root;
    while(z){
      i=q[s++];
      z--;
      for(j=(0);j<(es[i]);j++){
        k=edge[i][j];
        if(res[k]>=0){
          continue;
        }
        res[k]=res[i]+1;
        q[s+z++]=k;
      }
    }
  }
}
;
int N;
int A[200000];
int B[200000];
graph g;
int d[200000];
int cnt[200000];
int res[200000];
int main(){
  wmem = memarr;
  int i;
  int j;
  int k;
  int us[3] = {};
  int now[3] = {};
  int od = 0;
  int ev = 0;
  int co_od = -1;
  int co_ev = -1;
  int fg;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N-1);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1);
      rd(B[Lj4PdHRW]);B[Lj4PdHRW] += (-1);
    }
  }
  g.setEdge(N,N-1,A,B);
  g.getDist(0,d);
  for(i=(0);i<(N);i++){
    cnt[d[i]]++;
  }
  for(i=(0);i<(N);i+=(2)){
    ev += cnt[i];
  }
  for(i=(1);i<(N);i+=(2)){
    od += cnt[i];
  }
  for(i=(1);i<(N+1);i++){
    us[i%3]++;
  }
  if(ev >= us[1] && od >= us[2]){
    {
      auto ao_dF3pO = (1);
      auto tU__gIr_ = ( 2);
      co_ev = ao_dF3pO;
      co_od = tU__gIr_;
    }
  }
  if(ev >= us[2] && od >= us[1]){
    {
      auto a2conNHc = (2);
      auto hCmBdyQB = ( 1);
      co_ev = a2conNHc;
      co_od = hCmBdyQB;
    }
  }
  if(co_ev != -1){
    for(i=(0);i<(N);i++){
      if(d[i]%2==0){
        k =co_ev;
      }
      else{
        k =co_od;
      }
      if(now[k] == us[k]){
        k = 0;
      }
      if(k==0){
        res[i] = 3 * now[k] + k +3;
      }
      else{
        res[i] = 3 * now[k] + k +0;
      }
      now[k]++;
    }
  }
  else{
    if(ev <= us[0]){
      fg =0;
    }
    else{
      fg =1;
    }
    for(i=(0);i<(N);i++){
      k = 1;
      if(d[i]%2==fg){
        k = 0;
      }
      while(k <= 2 && now[k] == us[k]){
        k++;
      }
      if(k==3){
        k = 0;
      }
      if(k==0){
        res[i] = 3 * now[k] + k +3;
      }
      else{
        res[i] = 3 * now[k] + k +0;
      }
      now[k]++;
    }
  }
  {
    int iMWUTgY_;
    if(N==0){
      wt_L('\n');
    }
    else{
      for(iMWUTgY_=(0);iMWUTgY_<(N-1);iMWUTgY_++){
        wt_L(res[iMWUTgY_]);
        wt_L(' ');
      }
      wt_L(res[iMWUTgY_]);
      wt_L('\n');
    }
  }
  return 0;
}
// cLay varsion 20200308-1

// --- original code ---
// int N, A[2d5], B[2d5];
// 
// graph g;
// int d[2d5], cnt[2d5];
// int res[2d5];
// {
//   int i, j, k;
//   int us[3] = {}, now[3] = {};
//   int od = 0, ev = 0;
//   int co_od = -1, co_ev = -1;
//   int fg;
// 
//   rd(N,(A--,B--)(N-1));
//   g.setEdge(N,N-1,A,B);
//   g.getDist(0,d);
//   rep(i,N) cnt[d[i]]++;
//   rep(i,0,N,2) ev += cnt[i];
//   rep(i,1,N,2) od += cnt[i];
//   rep(i,1,N+1) us[i%3]++;
// 
//   //wt(cnt(N));
//   //wt("ev", ev);
//   //wt("od", od);
// 
//   if(ev >= us[1] && od >= us[2]) (co_ev, co_od) = (1, 2);
//   if(ev >= us[2] && od >= us[1]) (co_ev, co_od) = (2, 1);
//   if(co_ev != -1){
//     //wt("co_ev", co_ev);
//     //wt("co_od", co_od);
//     rep(i,N){
//       k = if[d[i]%2==0, co_ev, co_od];
//       if(now[k] == us[k]) k = 0;
//       res[i] = 3 * now[k] + k + if[k==0, 3, 0];
//       now[k]++;
//     }
//   } else {
//     fg = if[ev <= us[0], 0, 1];
//     //wt("fg", fg);
//     rep(i,N){
//       k = 1;
//       if(d[i]%2==fg) k = 0;
//       while(k <= 2 && now[k] == us[k]) k++;
//       if(k==3) k = 0;
//       res[i] = 3 * now[k] + k + if[k==0, 3, 0];
//       now[k]++;
//     }
//   }
//   wt(res(N));
// }


Measured memory_bytes: 14080