#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let n = get!(usize);
    let ab = get!(usize, usize; n-1);

    let mut nodes = vec![Vec::new(); n+1];
    for (a,b) in ab {
        nodes[a].push(b);
        nodes[b].push(a);
    }

    let mut cand = vec![Vec::new(); 3];
    for i in 1..n+1 {
        cand[i%3].push(i);
    }

    let mut vec = vec![Vec::new();2];
    fn dfs(node: usize, nodes: &Vec<Vec<usize>>, parent: usize, result: &mut Vec<Vec<usize>>, color: usize) {
        result[color].push(node);
        for &next in &nodes[node] {
            if next == parent {
                continue;
            }
            dfs(next, nodes, node, result, (color+1)%2);
        }
    }
    dfs(1,&nodes,0,&mut vec,0);
    let mut res = vec![0;n+1];
    if vec[0].len() > n/3 && vec[1].len() > n/3 {
        for i in 0..2 {
            for &e in &vec[i] {
                res[e] = if let Some(val) = cand[i+1].pop() {
                    val
                } else {
                    cand[0].pop().unwrap()
                };
            }
        }
    } else  if vec[0].len() > n/3 {
        for &e in &vec[1] {
            res[e] = cand[0].pop().unwrap();
        }
        for &e in &vec[0] {
            res[e] = if let Some(val) = cand[1].pop() {
                val
            } else if let Some(val) = cand[2].pop() {
                val
            } else {
                cand[0].pop().unwrap()
            };
        }
    } else {
        for &e in &vec[0] {
            res[e] = cand[0].pop().unwrap();
        }
        for &e in &vec[1] {
            res[e] = if let Some(val) = cand[1].pop() {
                val
            } else if let Some(val) = cand[2].pop() {
                val
            } else {
                cand[0].pop().unwrap()
            };
        }
    }
    for i in 1..n+1 {
        print!("{} ", res[i]);
    }
    println!("");
}


Measured memory_bytes: 36860