#include "conveyor.h"

#include <bits/stdc++.h>
using namespace std;

vector<pair<int,int>> G[100005];
int rem[100005], par[100005];
vector<int> cnt[3], target;

void dfs(int u, int p, int depth){
    par[u] = p;
    if(rem[u] > 0) {
        cerr << "!! " << u << ' ' << depth << '\n';
        cnt[depth].push_back(u);
    }
    for(pair<int,int> e: G[u]){
        int c = e.first;
        if(c != p){
            dfs(c, u, depth+1 - 3*(depth==2));
        }
    }
}

void Solve(int N, vector<int> A, vector<int> B) {
    vector<int> ans(N-1, 2), x(N-1), y(N);
    for(int i=0;i<N;i++) {
        G[i].clear();
        rem[i] = 0;
    }
    for(int i=0;i<N-1;i++){
        cerr << A[i] << ' ' << B[i] << '\n';
        G[A[i]].push_back({B[i], i+1});
        G[B[i]].push_back({A[i], -i-1});
        rem[A[i]]++;
        rem[B[i]]++;
    }
    while(true){

//        cerr << "REM: ";
//        for(int i=0;i<N;i++) cerr << rem[i] << ' ';
//        cerr << '\n';
        cnt[0].clear(); cnt[1].clear(); cnt[2].clear();
        target.clear();
        dfs(0, -1, 0);
        int s0 = cnt[0].size(), s1 = cnt[1].size(), s2 = cnt[2].size();
        if(s0 + s1 + s2 == 0) break;
        if(s0 >= max(s1, s2)) swap(target, cnt[0]);
        else if(s1 >= max(s0, s2)) swap(target, cnt[1]);
        else swap(target, cnt[2]);
        x = vector<int>(N-1, 0);
        y = vector<int>(N, 0);
        cerr << "SZ: " << target.size() << '\n';
        for(int item: target) {
            cerr << "DEBUG: " << item << ' ' << s0 << ' ' << s1 << ' ' << s2 << '\n';
            y[item] = 1;
            for(pair<int,int> e: G[item]){
                int c = e.first, idx = abs(e.second) - 1;
                if(ans[idx] != 2){
                    x[idx] = ans[idx] ^ (e.second > 0);
                }
            }
        }
//        cerr << "??? ";
//        for(int i=0;i<N-1;i++) cerr << ans[i] << ' ';
//        cerr << '\n';
        vector<int> res = Query(x, y);
        for(int u: target){
            bool ok = true, directall = (res[u] == 1);
            int pedge=0;
            for(pair<int,int> e: G[u]){
                int c = e.first, idx = abs(e.second) - 1;
                int p = par[u];
                if(directall){
                    if(ans[idx] == 2){
                        rem[u]--;
                        rem[c]--;
//                      cerr << "abc\n";
                        ans[idx] = (e.second > 0);
                    }
                    continue;
                }
                if(c != p && ans[idx] == 2 && (ok) && rem[c] > 0){
                    rem[u]--;
                    rem[c]--;
//                    cerr << "abc\n";
                    ans[idx] = (e.second < 0);
                    ok = false;
                }
                if(c == p) pedge = e.second;
            }
            if(ok && !directall){
//                cerr << "xyz\n";
                rem[u]--; rem[par[u]]--;
                ans[abs(pedge) - 1] = (pedge < 0);
            }
        }
        cerr << "REM: ";
        for(int i=0;i<N;i++) cerr << rem[i] << ' ';
        cerr << '\n';
    }
//    for(int item: ans) cerr << item << ' '; cerr << '\n';
    Answer(ans);
}