#include "conveyor.h"

#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using pii = pair <int, int>;
using vi = vector <int>;

void Solve(int n, vi x, vi y) {
  vi deg(n), p(n), id(n), dep(n), ans(n - 1, -1);
  vector <vector <pii>> e(n);
  rep(i, 0, n - 2) {
    ++ deg[x[i]], ++ deg[y[i]];
    e[x[i]].emplace_back(mp(y[i], i));
    e[y[i]].emplace_back(mp(x[i], i));
  }
  function <void(int)> dfs = [&](int u) {
    for (auto [v, i] : e[u]) if (v != p[u]) {
      p[v] = u, id[v] = i, dep[v] = dep[u] + 1, dfs(v);
    }
  } ;
  p[0] = -1, dfs(0);
  while (count(deg.begin(), deg.end(), 0) < n) {
    vi cnt(3), rev(n - 1), a(n);
    rep(u, 0, n - 1) cnt[dep[u] % 3] += deg[u] > 0;
    int r = max_element(cnt.begin(), cnt.end()) - cnt.begin();
    rep(u, 0, n - 1) if (deg[u]) a[u] = dep[u] % 3 == r;
    rep(u, 1, n - 1) if (~ans[id[u]]) {
      if (dep[p[u]] % 3 == r) rev[id[u]] = x[id[u]] == p[u];
      if (dep[u] % 3 == r) rev[id[u]] = x[id[u]] == u;
    }
    vi res = Query(rev, a);
    auto upd = [&](int i, int d) {
      if (!~ans[i]) -- deg[x[i]], -- deg[y[i]];
      ans[i] = d;
    } ;
    rep(u, 0, n - 1) if (deg[u] && dep[u] % 3 == r) {
      if (res[u]) {
        for (auto [v, i] : e[u]) upd(i, (x[i] == u) ^ rev[i]);
      }
      else {
        int w = -1, j = -1;
        for (auto [v, i] : e[u]) if (res[v]) {
          if (!~w || w == p[u]) w = v, j = i;
        }
        upd(j, (x[j] == w) ^ rev[j]);
      }
    }
  }
  Answer(ans);
}