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

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)

template <typename T>
inline bool found(set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(unordered_set<T> &s, T elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T, typename U>
inline bool found(unordered_map<T,U> &s, U elem) { return s.find(elem) != s.end(); }
template <typename T>
inline bool found(vector<T> &s, T elem) { return find(s.begin(), s.end(), elem) != s.end(); }
inline int found(string &s, string t) { return (int)s.find(t); }
inline int found(string &s, int c) { return (int)s.find(c); }

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

class UnionFind {
 public:
  vector<int> data;
  int count;
 public:
  UnionFind(int size) : data(size, -1), count(size) { }
  bool unionSet(int x, int y) {
    if (x == y) return false;
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
      --count;
    }
    return x != y;
  }
  bool isSame(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};

void solve(int N, vi& a, vi& b) {
    vvi nxt(N);
    rep(i,N-1){
        nxt[ a[i] ].pb( b[i] );
        nxt[ b[i] ].pb( a[i] );
    }

    vi ord(N,-1);
    queue<ii> q;
    q.push(ii(0,0));
    while (!q.empty()) {
        int u=q.front().first, o=q.front().second;
        q.pop();
        ord[u] = o;
        for (int v: nxt[u]){
            if (ord[v] != -1) continue;
            q.push(ii(v,(o+1)%2));
        }
    }

    UnionFind uf(N);
    rep(i,N-1){
        int u=a[i], v=b[i];
        int L1 = nxt[u].size() - 1, L2 = nxt[v].size() - 1;
        if (L1 && L2) {
            int u0 = -1;
            for (int w: nxt[u]){
                if (w != v) { u0 = w; break; }
            }
            for (int w: nxt[u]){
                if (w == v) continue;
                uf.unionSet(u0, w);
            }
            for (int w: nxt[v]){
                if (w == u) continue;
                uf.unionSet(u0, w);
            }
        }
    }

    map<int,vi> isles;
    rep(u,N) {
        int r = uf.root(u);
        isles[r].pb(u);
    }
    vvi al(2);
    for(auto& p: isles){
        int r=p.first;
        vvi gr(2);
        for(int u: p.second){
            gr[ ord[u] ].pb(u);
        }
        if (gr[0].size() > gr[1].size()) swap(gr[0], gr[1]);
        if (gr[0].size() > 0) {
            al[0].insert(al[0].end(), ALL(gr[0]));
            al[1].insert(al[1].end(), ALL(gr[1]));
        }
    }

    int one, two, three;
    one = two = three = N/3;
    switch (N%3) {
        case 0: break;
        case 1: one++; break;
        case 2: one++; two++; break;
    }

    int L0 = al[0].size(), L1 = al[1].size();
    assert(0 <= L0 && L0 <= L1);

    vi alloc(N, -1);
    if (L0 <= three) {
        for (int u: al[0]){
            alloc[u] = 3; three--;
        }
        for (int u: al[1]){
            if (one > 0) {
                alloc[u] = 1; one--;
            } else if (two > 0) {
                alloc[u] = 2; two--;
            } else {
                alloc[u] = 3; three--;
            }
        }
    } else {
        for (int u: al[0]){
            if (two > 0) {
                alloc[u] = 2; two--;
            } else {
                alloc[u] = 3; three--;
            }
        }
        for (int u: al[1]){
            if (one > 0) {
                alloc[u] = 1; one--;
            } else {
                alloc[u] = 3; three--;
            }
        }
    }
    rep(u,N){
        if (alloc[u] == -1){
            if (one > 0) {
                alloc[u] = 1; one--;
            } else if (two > 0) {
                alloc[u] = 2; two--;
            } else {
                alloc[u] = 3; three--;
            }
        }
    }
    vi cnt(4, 0);
    rep(u,N){
        printf("%d%c", alloc[u] + 3*cnt[alloc[u]], (u==N-1)?'\n':' ');
        cnt[ alloc[u] ]++;
    }
}

int main() {
    int N; scanf("%d%*c", &N);
    vi a(N-1), b(N-1);
    rep(i,N-1){
        scanf("%d %d%*c", &a[i], &b[i]);
        a[i]--; b[i]--;
    }
    solve(N,a,b);
    return 0;
}


Measured memory_bytes: 22520