#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
ll MAX_V=200005;
vector<ll>ret(MAX_V);
void dfs(ll k,vector<vector<ll>>&g,ll par,ll now){
  ret[k]=now;
  for(auto to:g[k]){
    if(to != par){
      dfs(to,g,k,now^1); 
    }
  }
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<vector<ll>>g(n);
  rep(i,0,n-1){
    ll a,b;cin>>a>>b;a--;b--;
    g[a].PB(b);
    g[b].PB(a);
  }
  vector<ll>cnt(2);
  dfs(0,g,-1,0);
  //debug(ret,n);
  rep(i,0,n)cnt[ret[i]]++;
  if(cnt[0]<cnt[1]){
    swap(cnt[0],cnt[1]);
    rep(i,0,n)ret[i]^=1;
  }
  ll cnt1=(n+2)/3,cnt2=(n+1)/3,cnt3=n/3;
  vector<ll>p(n);
  //debug(cnt,2);
  //debug(ret,n);
  if(cnt1<=cnt[0]&&cnt2<=cnt[1]){
    rep(i,0,n){
      if(ret[i]==0&&cnt1>0){
      p[i]=cnt1*3-2;
      cnt1--;
      }
      else if(ret[i]==1&&cnt2>0){
        p[i]=cnt2*3-1;
        cnt2--;
      }
      else{
        p[i]=cnt3*3;
        cnt3--;
      }
    }
  }
  else{
    //debug(ret,n);
    rep(i,0,n){
      if(ret[i]==0&&cnt1>0){
      p[i]=cnt1*3-2;
      cnt1--;
      }
      else if(ret[i]==0&&cnt2>0){
        p[i]=cnt2*3-1;
        cnt2--;
      }
      else{
        p[i]=cnt3*3;
        cnt3--;
      }
    }
  }
  debug(p,n);
  return 0;
}

Measured memory_bytes: 21888