#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

vector<int> G[200'010];
bool color[200'010];
void dfs(int v, int p = -1, bool now = true){
  color[v] = now;
  for(int nv: G[v]){
    if(nv == p)continue;
    dfs(nv, v, !now);
  }
  return;
}

int main(){
  //using namespace std;
  int n;
  cin>>n;
  int a[n - 1], b[n - 1];
  REP(i, n - 1){
    cin>>a[i]>>b[i];
    a[i]--;b[i]--;
    G[a[i]].push_back(b[i]);
    G[b[i]].push_back(a[i]);
  }
  dfs(0);
  int tcnt = 0, fcnt = 0;
  REP(i, n){
    if(color[i]){
      tcnt++;
    }else{
      fcnt++;
    }
  }
  stack<int> s0, s1, s2;
  REPP(i, n){
    if(i % 3 == 0){
      s0.push(i);
    }else if(i % 3 == 1){
      s1.push(i);
    }else{
      s2.push(i);
    }
  }
  int ans[n] = {};
  if(tcnt <= n / 3){
    REP(i, n){
      if(color[i]){
        int temp = s0.top();
        s0.pop();
        ans[i] = temp;
      }
    }
    REP(i, n){
      if(color[i])continue;
      if(s0.size() > 0){
        int temp = s0.top();
        s0.pop();
        ans[i] = temp;
        continue;
      }
      if(s1.size() > 0){
        int temp = s1.top();
        s1.pop();
        ans[i] = temp;
        continue;
      }
      if(s2.size() > 0){
        int temp = s2.top();
        s2.pop();
        ans[i] = temp;
        continue;
      }
    }
  }else if(fcnt <= n / 3){
    REP(i, n){
      if(!color[i]){
        int temp = s0.top();
        s0.pop();
        ans[i] = temp;
      }
    }
    REP(i, n){
      if(!color[i])continue;
      if(s0.size() > 0){
        int temp = s0.top();
        s0.pop();
        ans[i] = temp;
        continue;
      }
      if(s1.size() > 0){
        int temp = s1.top();
        s1.pop();
        ans[i] = temp;
        continue;
      }
      if(s2.size() > 0){
        int temp = s2.top();
        s2.pop();
        ans[i] = temp;
        continue;
      }
    }
  }else{
    REP(i, n){
      if(color[i]){
        if(s1.size() > 0){
          int temp = s1.top();
          s1.pop();
          ans[i] = temp;
        }else{
          int temp = s0.top();
          s0.pop();
          ans[i] = temp;
        }
      }else{
        if(s2.size() > 0){
          int temp = s2.top();
          s2.pop();
          ans[i] = temp;
        }else{
          int temp = s0.top();
          s0.pop();
          ans[i] = temp;
        }
      }
    }
  }
  
  REP(i, n){
    cout<<ans[i]<<' ';
  }
  cout<<endl; 
  return 0;
}



Measured memory_bytes: 16500