#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
  for (pair<T1, T2> &t : v) is >> t.first >> t.second;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &t : v) is >> t;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (const T &t : v) {
    os << t << " ";
  }
  os << '\n';
  return os;
}
double pi = acos(-1.0);
long long md = 1000000007;
long long abst(long long a) { return a < 0 ? -a : a; }
struct HASH {
  size_t operator()(const pair<long long, long long> &x) const {
    return (size_t)x.first * 37U + (size_t)x.second;
  }
};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long Pow(long long n, long long x) {
  long long ans = 1;
  while (x > 0) {
    if (x & 1) ans = (ans * n) % md;
    n = (n * n) % md;
    x = x >> 1;
  }
  return ans;
}
vector<long long> fact, inv;
void inverse(long long n) {
  inv.resize(n + 1);
  inv[0] = 1;
  for (long long i = 1; i <= n; i++) inv[i] = Pow(fact[i], md - 2);
}
void factorial(long long n) {
  fact.resize(n + 1);
  fact[0] = 1;
  for (long long i = 1; i <= n; i++) fact[i] = (fact[i - 1] * i) % md;
}
vector<vector<long long>> c(100005, vector<long long>(3));
vector<long long> v[100005];
vector<long long> g(3);
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
void DFS(long long x, vector<long long> &vis, long long ind) {
  vis[x] = g[ind];
  long long j = 1;
  for (long long i : v[x])
    if (vis[i] == -1) {
      DFS(i, vis, (ind + j) % 3);
      j++;
    }
}
void solve() {
  long long n;
  cin >> n;
  for (long long i = 0; i < 3; i++)
    for (long long j = 0; j < n; j++) cin >> c[j][i];
  for (long long i = 0; i < n - 1; i++) {
    long long x, y;
    cin >> x >> y;
    x--;
    y--;
    v[x].emplace_back(y);
    v[y].emplace_back(x);
  }
  long long so;
  for (long long i = 0; i < n; i++) {
    if (v[i].size() >= 3) {
      cout << -1;
      return;
    }
    if (v[i].size() == 1) so = i;
  }
  long long ans = LLONG_MAX;
  vector<long long> ansv(n);
  g[0] = 0;
  g[1] = 1;
  g[2] = 2;
  do {
    vector<long long> vis(n, -1);
    DFS(so, vis, 0);
    long long count = 0;
    for (long long i = 0; i < n; i++) count += c[i][vis[i]];
    if (count < ans) {
      ans = count;
      ansv = vis;
    }
  } while (next_permutation(g.begin(), g.end()));
  cout << ans << "\n";
  for (long long i : ansv) cout << i + 1 << " ";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
