#include <bits/stdc++.h>
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::make_pair;
using std::map;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::string;
using std::stringstream;
using std::vector;
class MyTimer {
 public:
  void reset() {}
  void report() {}
} myTimer;
template <typename T1, typename T2>
inline bool chmin(T1 &a, const T2 &b) {
  return a > b ? a = b, true : false;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, const T2 &b) {
  return a < b ? a = b, true : false;
}
inline int readint() {
  int a = 0;
  char c = getchar(), p = 0;
  while (isspace(c)) c = getchar();
  if (c == '-') p = 1, c = getchar();
  while (isdigit(c)) a = a * 10 + c - '0', c = getchar();
  return p ? -a : a;
}
inline long long readLL() {
  long long a = 0;
  char c = getchar(), p = 0;
  while (isspace(c)) c = getchar();
  if (c == '-') p = 1, c = getchar();
  while (isdigit(c)) a = a * 10 + c - '0', c = getchar();
  return p ? -a : a;
}
const int maxN = 180 + 5;
const int INF = 0x3f3f3f3f;
int n, w[maxN];
int p[maxN][maxN], d[maxN][maxN];
vector<int> G[maxN];
void init(int u, int root, int fa) {
  for (int v : G[u])
    if (v != fa) {
      p[v][root] = u;
      d[v][root] = d[u][root] + 1;
      init(v, root, u);
    }
}
int f[maxN][maxN], g[maxN];
void DFS(int u, int fa) {
  memset(f[u], INF, sizeof(f[u]));
  for (int v : G[u])
    if (v != fa) DFS(v, u);
  g[u] = INF;
  for (int t = 1; t <= n; ++t) {
    f[u][t] = w[d[u][t]];
    if (p[u][t] != fa) {
      f[u][t] = w[d[u][t]];
      for (int v : G[u])
        if (v != fa)
          if (v == p[u][t])
            f[u][t] += f[v][t];
          else
            f[u][t] += std::min(f[v][t], g[v]);
        else {
        }
      chmin(g[u], f[u][t]);
    } else {
      for (int v : G[u])
        if (v != fa) f[u][t] += std::min(f[v][t], g[v]);
    }
  }
}
int master[maxN];
void printG(int u, int fa);
void printF(int u, int t, int fa) {
  master[u] = t;
  if (p[u][t] != fa) {
    for (int v : G[u])
      if (v != fa)
        if (v == p[u][t])
          printF(v, t, u);
        else
          f[v][t] < g[v] ? printF(v, t, u) : printG(v, u);
      else {
      }
  } else {
    for (int v : G[u])
      if (v != fa) f[v][t] < g[v] ? printF(v, t, u) : printG(v, u);
  }
}
void printG(int u, int fa) {
  for (int t = 1; t <= n; ++t)
    if (p[u][t] != fa)
      if (g[u] == f[u][t]) {
        printF(u, t, fa);
        return;
      }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> w[i];
  for (int i = 1; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    G[x].push_back(y);
    G[y].push_back(x);
  }
  for (int root = 1; root <= n; ++root) {
    p[root][root] = root;
    d[root][root] = 0;
    init(root, root, -1);
  }
  DFS(1, -1);
  printf("%d\n", g[1]);
  printG(1, -1);
  for (int u = 1; u <= n; ++u) printf("%d%c", master[u], " \n"[u == n]);
  return 0;
}
