#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "split.h"
Adj G;
vi res, par, sz;
int re;
void dfs(int v) {
if (v == re) return;
sz[v] = 1;
forl(c, G[v]) if (c != par[v]) {
par[c] = v;
dfs(c);
sz[v] += sz[c];
}
}
void get_res(int v, int &rem, int lbl) {
if (v == re || !rem) return;
res[v] = lbl;
rem--;
forl(c, G[v]) if (c != par[v]) get_res(c, rem, lbl);
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
G.assign(n, {});
res.assign(n, 0);
par.assign(n, 0);
sz.assign(n, 0);
int m = p.size();
f0r(i, m) {
G[p[i]].pb(q[i]);
G[q[i]].pb(p[i]);
}
V<pi> lab{{a, 1}, {b, 2}, {c, 3}};
sort(all(lab));
f0r(i, 2) {
swap(lab[0], lab[1]);
res.assign(n, 0);
sz.assign(n, 0);
re = -1;
dfs(0);
pi best = {2e9, 2e9};
f0r(j, n) if (sz[j] >= lab[1].F) best = min(best, {sz[j], j});
if (best.F == 2e9) continue;
int rem = lab[1].F;
get_res(best.S, rem, lab[1].S);
re = best.S;
sz.assign(n, 0);
dfs(0);
best = {2e9, 2e9};
f0r(j, n) if (sz[j] >= lab[0].F) best = min(best, {sz[j], j});
if (best.F == 2e9) continue;
rem = lab[0].F;
get_res(best.S, rem, lab[0].S);
f0r(j, n) if (!res[j]) res[j] = lab[2].S;
return res;
}
return vi(n);
}
