#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"
using namespace std;
Adj G;
vi res, par;
V<pi> sz;
V<bool> rem;
void dfs(int v) {
if (rem[v]) return;
sz[v].F = 1;
forl(c, G[v]) if (c != par[v]) {
par[c] = v;
dfs(c);
sz[v].F += sz[c].F;
}
}
void get_res(int v, vi &out, int b) {
if (rem[v]) return;
if (out.size() == b) {
return;
}
out.pb(v);
rem[v] = 1;
forl(c, G[v]) if (c != par[v]) get_res(c, out, b);
}
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);
rem.assign(n, 0);
par.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));
bool fnd = 0;
f0r(i, 2) {
swap(lab[0], lab[1]);
res.assign(n, 0);
sz.resize(n);
f0r(i, n) sz[i] = {0, i};
rem.assign(n, 0);
dfs(0);
sort(all(sz));
auto it = lower_bound(all(sz), make_pair(lab[1].F, 0));
if (it == sz.end()) continue;
vi out;
get_res(it->S, out, lab[1].F);
forl(x, out) res[x] = lab[1].S;
f0r(i, n) sz[i] = {0, i};
dfs(0);
sort(all(sz));
it = lower_bound(all(sz), make_pair(lab[0].F, 0));
if (it == sz.end()) continue;
out.clear();
get_res(it->S, out, lab[0].F);
forl(x, out) res[x] = lab[0].S;
f0r(i, n) if (!res[i]) res[i] = lab[2].S;
return res;
}
if (!fnd) return vi(n);
//vi cnt(3);
//f0r(i, n) cnt[res[i]-1]++;
//ctl(cnt);
return res;
}
