#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<vi> adj(n);
int m = p.size();
REP(i, m){
adj[p[i]].pb(q[i]);
adj[q[i]].pb(p[i]);
}
array<array<int, 2>, 3> P;
P[0] = {a, 1}; P[1] = {b, 2}; P[2] = {c, 3};
sort(all(P));
a = P[0][0]; b = P[1][0]; c = P[2][0];
int t = 0;
vi in(n, -1);
vi low(n, INF);
vi subsz(n, 1);
bool fn = false;
vi res(n, 0);
vi to_reset;
function<void(int, int, int)> dfs_mark = [&](int v, int p, int id){
res[v] = id;
for(int x : adj[v]){
if(in[x] < in[v] || x == p) continue;
dfs_mark(x, v, id);
}
};
function<void(int, int)> dfs = [&](int v, int p){
in[v] = ++t;
for(int x : adj[v]){
if(x == p) continue;
if(in[x] == -1){
dfs(x, v);
subsz[v] += subsz[x];
low[v] = min(low[v], low[x]);
}
else if(in[v] > in[x]){
low[v] = min(low[v], in[x]);
}
}
if(fn) return;
if(!(subsz[v] >= a)) return;
bool other_a = false;
for(int x : adj[v]){
if(x == p) continue;
if(in[x] < in[v]) continue;
if(subsz[x] >= a) other_a = true;
}
vi removed;
if(!other_a){
int curr = subsz[v];
for(int x : adj[v]){
if(fn) break;
if(x == p || in[x] < in[v]) continue;
if(low[x] >= in[v]) continue;
if(curr - subsz[x] < a){
fn = true;
continue;
}
else{
removed.pb(x);
curr -= subsz[x];
}
}
if((n - curr) >= a){
fn = true;
}
if(fn){
int pp = 0;
if(curr >= b){
res[v] = P[1][1];
}
else{
res[v] = P[0][1];
}
for(int x : adj[v]){
if(x == p || in[x] < in[v]) continue;
if(pp < (int)removed.size() && x == removed[pp]){
pp++;
continue;
}
if(curr >= b){
dfs_mark(x, v, P[1][1]);
}
else{
dfs_mark(x, v, P[0][1]);
}
}
}
}
};
dfs(0, -1);
if(!fn){
return vi(n, 0);
}
int to_color = 0;
function<void(int, int)> ndfs = [&](int v, int col){
if(to_color == 0) return;
res[v] = col;
to_color--;
for(int x : adj[v]){
if(res[x] == 0)
ndfs(x, col);
}
};
int next_col;
int used = *max_element(all(res));
if(P[0][1] == used){
next_col = P[1][1];
to_color = P[1][0];
}
else{
next_col = P[0][1];
to_color = P[0][0];
}
REP(i, n){
if(res[i] == 0){
ndfs(i, next_col);
break;
}
}
REP(i, n){
if(res[i] == 0)
res[i] = P[2][1];
}
return res;
}
