import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import std.regex;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;

enum long INF = long.max/5;
enum long MOD = 10L^^9+7;

class Vertex {
  long index;
  bool even;
  long p = -1;
  long d = -1;
  long[] ds;
  long firstI = -1;
  long secondI = -1;
  Vertex[] adj;
  mixin Constructor;
}

void main() {
  long N;
  scanln(N);

  Vertex[] vs = N.iota.map!(i => new Vertex(i)).array;
  foreach(i; 0..N-1) {
    long a, b;
    scanln(a, b);
    a--; b--;
    vs[a].adj ~= vs[b];
    vs[b].adj ~= vs[a];
  }

  void f(Vertex v, Vertex from, long c = 0) {
    v.even = c%2 == 0;
    foreach(u; v.adj) {
      if (u is from) continue;
      f(u, v, c+1);
    }
  }
  f(vs[0], null);

  {
    bool even = vs.count!"a.even" >= vs.count!"!a.even";
    if (!even) {
      foreach(v; vs) {
        v.even ^= true;
      }
    }
  }

  Vertex sweep(Vertex v, Vertex from, long d = 0) {
    v.d = d;
    Vertex res = v;
    foreach(u; v.adj) {
      if (u is from) continue;
      Vertex w = sweep(u, v, d + 1);
      if (w.d > res.d) {
        res = w;
      }
    }
    return res;
  }
  Vertex w = sweep(sweep(vs[0], null), null);

  foreach(v; vs) {
    v.ds = new long[v.adj.length];
    v.ds[] = -1;
  }
  long dfs(Vertex v, Vertex from) {
    long d = 0;
    foreach(i, u; v.adj) {
      if (u is from) continue;
      v.ds[i] = dfs(u, v) + 1;
      if (v.ds[i] >= d) {
        v.secondI = v.firstI;
        v.firstI = i;
        d = v.ds[i];
      }
    }
    return d;
  }
  void dfs2(Vertex v, Vertex from, long d) {
    foreach(i, u; v.adj) {
      if (u is from) {
        v.ds[i] = d;
        if (v.firstI < 0 || d >= v.ds[v.firstI]) {
          v.secondI = v.firstI;
          v.firstI = i;
        } else if (v.secondI < 0 || d >= v.ds[v.secondI]) {
          v.secondI = i;
        }
      }
    }
    foreach(i, u; v.adj) {
      if (u is from) {
        continue;
      }
      if (i == v.firstI) {
        dfs2(u, v, (v.secondI<0 ? 0L : v.ds[v.secondI]) + 1);
      } else {
        dfs2(u, v, v.ds[v.firstI] + 1);
      }
    }
  }
  dfs(w, null);
  dfs2(w, null, 0);

  long[3] xs = new long[3];
  xs[0]++;

  foreach(v; vs) {
    if (v.ds[v.firstI] < 3) {
      if (xs[2]*3+2 <= N) {
        v.p = xs[2]*3+2;
        xs[2]++;
      } else if (xs[1]*3+1 <= N) {
        v.p = xs[1]*3+1;
        xs[1]++;
      } else {
        v.p = xs[0]*3+0;
        xs[0]++;
      }
    }
  }

  foreach(v; vs) {
    if (!v.even) {
      if (v.p != -1) continue;
      if (xs[2]*3+2 <= N) {
        v.p = xs[2]*3+2;
        xs[2]++;
      } else if (xs[0]*3+0<=N) {
        v.p = xs[0]*3+0;
        xs[0]++;
      } else {
        v.p = xs[1]*3+1;
        xs[1]++;
      }
    }
  }

  foreach(v; vs) {
    if (v.even) {
      if (v.p != -1) continue;
      if (xs[1]*3+1 <= N) {
        v.p = xs[1]*3+1;
        xs[1]++;
      } else {
        v.p = xs[0]*3+0;
        if(v.p > N) {
          writeln(-1);
          return;
        }
        xs[0]++;
      }
    }
  }

  vs.map!"a.p".map!(to!string).join(" ").writeln;
}

// ----------------------------------------------


void times(alias fun)(long n) {
  // n.iota.each!(i => fun());
  foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(long n) {
  // return n.iota.map!(i => fun()).array;
  T[] res = new T[n];
  foreach(ref e; res) e = fun();
  return res;
}

T ceil(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  // `(x+y-1)/y` will only work for positive numbers ...
  T t = x / y;
  if (y > 0 && t * y < x) t++;
  if (y < 0 && t * y > x) t++;
  return t;
}

T floor(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  T t = x / y;
  if (y > 0 && t * y > x) t--;
  if (y < 0 && t * y < x) t--;
  return t;
}

ref T ch(alias fun, T, S...)(ref T lhs, S rhs) {
  return lhs = fun(lhs, rhs);
}
unittest {
  long x = 1000;
  x.ch!min(2000);
  assert(x == 1000);
  x.ch!min(3, 2, 1);
  assert(x == 1);
  x.ch!max(100).ch!min(1000); // clamp
  assert(x == 100);
  x.ch!max(0).ch!min(10); // clamp
  assert(x == 10);
}

mixin template Constructor() {
  import std.traits : FieldNameTuple;
  this(Args...)(Args args) {
    // static foreach(i, v; args) {
    foreach(i, v; args) {
      mixin("this." ~ FieldNameTuple!(typeof(this))[i]) = v;
    }
  }
}

void scanln(Args...)(auto ref Args args) {
  enum sep = " ";
  enum n = Args.length;
  enum fmt = n.rep!(()=>"%s").join(sep);

  string line = readln.chomp;
  static if (__VERSION__ >= 2074) {
    line.formattedRead!fmt(args);
  } else {
    enum argsTemp = n.iota.map!(
      i => "&args[%d]".format(i)
    ).join(", ");
    mixin(
      "line.formattedRead(fmt, " ~ argsTemp ~ ");"
    );
  }
}

// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
  template fold(fun...) if (fun.length >= 1) {
    auto fold(R, S...)(R r, S seed) {
      static if (S.length < 2) {
        return reduce!fun(seed, r);
      } else {
        return reduce!fun(tuple(seed), r);
      }
    }
  }
}

// popcnt with ulongs was added in D 2.071.0
static if (__VERSION__ < 2071) {
  ulong popcnt(ulong x) {
    x = (x & 0x5555555555555555L) + (x>> 1 & 0x5555555555555555L);
    x = (x & 0x3333333333333333L) + (x>> 2 & 0x3333333333333333L);
    x = (x & 0x0f0f0f0f0f0f0f0fL) + (x>> 4 & 0x0f0f0f0f0f0f0f0fL);
    x = (x & 0x00ff00ff00ff00ffL) + (x>> 8 & 0x00ff00ff00ff00ffL);
    x = (x & 0x0000ffff0000ffffL) + (x>>16 & 0x0000ffff0000ffffL);
    x = (x & 0x00000000ffffffffL) + (x>>32 & 0x00000000ffffffffL);
    return x;
  }
}
