#include <cassert>
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <memory>
#include <utility>
#include <limits>
 
#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

void debug_out(){std::cerr<<std::endl;}

template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
  std::cerr<<" "<<h;
  debug_out(t...);
}
 
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}
 
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t  i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
 
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
 
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
 
long long pow_mod(long long a, long long b, long long mod=-1) {
  if(b==0)return 1;
  if ((a == 0)||(mod!=-1&&(a+mod)%mod==0))return 0;
  long long x = 1;
  while (b > 0) {
    if (b & 1)x = (mod!=-1)?(x * a) % mod:x*a;
    a = (mod!=-1)?(a * a) % mod:a*a;
    b >>= 1;
  }
  return x;
}

// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;

using ll = long long;
using P=std::pair<long long,long long>;

ll gcd(ll a,ll b){
  if(a%b==0)return b;
  return gcd(b,a%b);
}

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin>>n;

  std::vector<std::vector<ll>> graph(n);
  rep(i,0,n-1){
    ll a,b;
    std::cin>>a>>b;
    a--;b--;
    graph[a].emplace_back(b);
    graph[b].emplace_back(a);
  }

  std::vector<ll> depth(n,0);

  auto dfs=[&](auto f,ll now,ll par)->void{
    for(auto e:graph[now]){
      if(par==e)continue;
      depth[e]=depth[now]+1;
      f(f,e,now);
    }
  };

  dfs(dfs,0,-1);

  ll r=0,b=0;

  rep(i,0,n){
    if(depth[i]%2)r++;
    else b++;
  }

  assert(r+b==n);

  ll mod[3]={3,1,2};

  std::vector<ll> ans(n,0);

  if(r<=(n/3)){
    rep(i,0,n){
      if(depth[i]%2){
        ans[i]=mod[0];
        mod[0]+=3;
      }
    }
    rep(i,0,n){
      if((depth[i]%2)==0){
        if(mod[0]<=n){
          ans[i]=mod[0];
          mod[0]+=3;
        }else if(mod[1]<=n){
          ans[i]=mod[1];
          mod[1]+=3;
        }else if(mod[2]<=n){
          ans[i]=mod[2];
          mod[2]+=3;
        }
      }
    }
  }else if(b<=(n/3)){
    rep(i,0,n){
      if(depth[i]%2==0){
        ans[i]=mod[0];
        mod[0]+=3;
      }
    }
    rep(i,0,n){
      if((depth[i]%2)){
        if(mod[0]<=n){
          ans[i]=mod[0];
          mod[0]+=3;
        }else if(mod[1]<=n){
          ans[i]=mod[1];
          mod[1]+=3;
        }else if(mod[2]<=n){
          ans[i]=mod[2];
          mod[2]+=3;
        }
      }
    }
  }else{
    rep(i,0,n){
      if(depth[i]%2){
        if(mod[1]<=n){
          ans[i]=mod[1];
          mod[1]+=3;
        }else{
          ans[i]=mod[0];
          mod[0]+=3;
        }
      }else{
        if(mod[2]<=n){
          ans[i]=mod[2];
          mod[2]+=3;
        }else{
          ans[i]=mod[0];
          mod[0]+=3;
        }
      }
    }
  }

  rep(i,0,n){
    assert(0<ans[i]&&ans[i]<=n);
    std::cout<<ans[i]<<" ";
  }

  std::cout<<"\n";

  return 0;
}



Measured memory_bytes: 18176