#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
//#pragma GCC optimize("O0")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 9223372036854775806;
//const int mod = 2600000069;
//const int p = 179;

vector<vector<int>> g, c;
vector<int> perm(3), answer, color;
int cur, ans = INF;

void dfs(int v, int ind) {
    color[v] = perm[ind];
    cur += c[perm[ind]][v];
    for (auto u : g[v]) {
        if (color[u] == -1) {
            dfs(u, (ind + 1) % 3);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    g.resize(n);
    c.assign(3, vector<int>(n));
    answer.resize(n);
    color.assign(n, 0);
    vector<int> pw(n, 0);
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < n; j++) cin >> c[i][j];
    }
    int u, v;
    for (int i = 0; i < n-1; i++) {
        cin >> u >> v;
        u--;v--;
        g[u].pb(v);
        g[v].pb(u);
        pw[u]++;
        pw[v]++;
        if (pw[u] > 2 || pw[v] > 2) {
            cout << -1;
            return 0;
        }
    }
    int start = 0;
    for (int i =0 ; i < n; i++)  {
        if (pw[i] == 1) {start = i; break;}
    }
    for (int f = 0; f < 3; f++) {
        for (int s = 0; s < 3; s++) {
            if (f == s) continue;
            for (int t = 0; t < 3; t++) {
                if (t == s || t ==f ) continue;
//                cout << f << " " << s << " " << t << "\n";
                perm[0] = f;
                perm[1] = s;
                perm[2] = t;
                cur = 0;
                color.assign(n, -1);
                dfs(start, 0);
                if (cur < ans) {
                    ans = cur;
                    answer = color;
                }
            }
        }
    }
    cout << ans << "\n";
    for (auto k : answer) {cout << k + 1 << " ";}
}
/*

*/