#include <bits/stdc++.h>
#include "split.h"
using namespace std;
vector<vector<int>> g;
vector<int> ans;
void dfs(int u, int c, int t) {
if (t == 0) return;
ans[u] = c;
for (int v : g[u]) {
if (ans[v] == 0) {
dfs(v, c, t - 1);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
g.resize(n);
ans.resize(n);
for (int i = 0; i < n - 1; i++) {
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
vector<array<int, 2>> v = {{a, 1}, {b, 2}, {c, 3}};
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (ans[i] == 0) {
dfs(i, v[0][0], v[0][1]);
break;
}
}
for (int i = 0; i < n; i++) {
if (ans[i] == 0) {
dfs(i, v[1][0], v[1][1]);
break;
}
}
for (int i = 0; i < n; i++) {
if (ans[i] == 0) {
ans[i] = v[2][0];
}
}
return ans;
}
