#include "conveyor.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
void Solve(int n, vector<int> A, vector<int> B) {
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < n - 1; ++i) {
    g[A[i]].emplace_back(B[i], i);
    g[B[i]].emplace_back(A[i], i);
  }
  vector<int> buc[3], ans(n - 1, -1);
  function<void(int, int, int)> dfs = [&](int u, int pre, int d) {
    buc[d].emplace_back(u);
    for (auto &e : g[u]) {
      int v = e.first;
      if (v == pre) continue;
      dfs(v, u, d == 2 ? 0 : d + 1);
    }
  };
  dfs(0, -1, 0);
  int num[3];
  while (find(ans.begin(), ans.end(), -1) != ans.end()) {
    fill(num, num + 3, 0);
    for (int d = 0; d < 3; ++d) {
      for (auto u : buc[d]) {
        bool have = false;
        for (auto &e : g[u]) {
          int id = e.second;
          if (ans[id] == -1) {
            have = true;
            break;
          }
        }
        num[d] += have;
      }
    }
    int d = max_element(num, num + 3) - num;
    vector<int> x(n - 1), y(n);
    for (auto u : buc[d]) {
      y[u] = 1;
      for (auto &e : g[u]) {
        int id = e.second;
        if (ans[id] != -1) x[id] = ans[id] ^ (A[id] == u);
      }
    }
    vector<int> z = Query(x, y);
    for (auto u : buc[d]) {
      if (z[u]) {
        for (auto &e : g[u]) {
          int id = e.second;
          if (ans[id] == -1) ans[id] = (A[id] == u);
        }
      } else {
        for (auto &e : g[u]) {
          int v, id;
          tie(v, id) = e;
          if (z[v]) {
            ans[id] = (B[id] == u);
            break;
          }
        }
      }
    }
  }
  Answer(ans);
}
// g++ conveyor.cpp grader.cpp -o conveyor -Wall -Wextra -Wshadow -O2 -std=c++14 -fsanitize=address,undefined