#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <limits.h>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

ll Ch[200007];
vector<ll> A,B;
ll ANS[200007];
vector<vector<ll>> E(200007);

void dfs(ll key,ll num){
  if(num%2==0){
    A.pb(key);
  }
  else{
    B.pb(key);
  }
  Ch[key]=1;
  rep(i,E[key].size()){
    if(Ch[E[key][i]]==0){
      dfs(E[key][i],num+1);
    }
  }
}

ll C[200007];

int main(){
  ll N ;
  cin >> N ;
  ll M=N-1;
  
  rep(i,M){
    ll X, Y;
    cin >> X >> Y ;
    X--;Y--;
    E[X].push_back(Y);
    E[Y].push_back(X);
  }
  dfs(0,0);
  ll B3=3,Z=1;
  if(A.size()<=N/3){
    rep(i,A.size()){
      ANS[A[i]]=B3;
      B3+=3;
    }
    rep(i,N){
      if(ANS[i]==0){
        if(Z<B3&&Z%3==0){
          Z++;
        }
        ANS[i]=Z;
        Z++;
      }
    }
  }
  else if(B.size()<=N/3){
    rep(i,B.size()){
      ANS[B[i]]=B3;
      B3+=3;
    }
    rep(i,N){
      if(ANS[i]==0){
        if(Z<B3&&Z%3==0){
          Z++;
        }
        ANS[i]=Z;
        Z++;
      }
    }
  }
  else{
    ll a=1,b=2;
    rep(i,A.size()){
      if(a<=N){
        ANS[A[i]]=a;
        C[a]=1;
        a+=3;
      }
      else{
        ANS[A[i]]=B3;
        C[B3]=1;
        B3+=3;
      }
    }
    rep(i,B.size()){
      if(b<=N){
        ANS[B[i]]=b;
        b+=3;
      }
      else{
        ANS[B[i]]=B3;
        B3+=3;
      }
    }
  }
  rep(i,N){
    cout << ANS[i];
    if(i!=N-1){
      cout << " ";
    }
  }
  cout << endl;
}


Measured memory_bytes: 27100