#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef gp_hash_table<int, null_type,hash<int>, equal_to<int>, direct_mask_range_hashing<int>, linear_probe_fn<>,
    hash_standard_resize_policy<hash_exponential_size_policy<>, hash_load_check_resize_trigger<true>,true>> hash_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define EPS 1e-9
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 200005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

const ld PI = (ld)4*atanl(1);

mt19937 g1(chrono::steady_clock::now().time_since_epoch().count());

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

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);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_nodes,cnt[2],col[MAXN],ans[MAXN];
bool vis[MAXN];
vector<int> nodes[2],adj[MAXN];

int main(){
    scanf("%d",&num_nodes);
    for(int i=1; i<num_nodes; i++){
        int a,b; scanf(" %d %d",&a,&b);
        adj[a].pb(b);
        adj[b].pb(a);
    }
    queue<int> q;
    q.push(1);
    vis[1] = true;
    while(q.size()){
        int node = q.front(); q.pop();
        cnt[col[node]]++;
        nodes[col[node]].pb(node);
        for(int check:adj[node]){
            if(vis[check]) continue;
            col[check] = 1-col[node];
            vis[check] = true;
            q.push(check);
        }
    }
    memset(vis,0,sizeof vis);
    if(min(cnt[0],cnt[1]) <= num_nodes/3){
        if(cnt[0] > cnt[1]) swap(nodes[0],nodes[1]);
        int cc = 1;
        for(int check:nodes[0]){
            ans[check] = cc*3;
            vis[ans[check]] = true;
            cc++;
        }
        cc = 1;
        for(int check:nodes[1]){
            while(vis[cc]) cc++;
            ans[check] = cc++;
        }
    }else{
        for(int i=1; i<=num_nodes; i+=3) ans[nodes[0][(i-1)/3]] = i, vis[i] = true;
        for(int i=2; i<=num_nodes; i+=3) ans[nodes[1][(i-1)/3]] = i, vis[i] = true;
        int cc = 1;
        for(int check:nodes[0]){
            if(ans[check]) continue;
            while(vis[cc]) cc++;
            ans[check] = cc++;
        }
        for(int check:nodes[1]){
            if(ans[check]) continue;
            while(vis[cc]) cc++;
            ans[check] = cc++;
        }
    }
    for(int i=1; i<=num_nodes; i++)
        printf("%d ",ans[i]);
}

Measured memory_bytes: 16604