#include <bits/stdc++.h>
using namespace std;
const int maxn = 203;
int n, k, cost[maxn], dis[maxn][maxn], e[maxn][maxn], pos[maxn], ans[maxn],
    f[maxn][maxn];
void dfs(int u, int pre) {
  for (int i = 1; i <= n; ++i) f[i][u] = cost[dis[i][u]] + k;
  for (int i = 1; i <= n; ++i) {
    if (e[u][i] && i != pre) {
      dfs(i, u);
      for (int j = 1; j <= n; ++j) f[j][u] += min(f[pos[i]][i], f[j][i] - k);
    }
  }
  pos[u] = 1;
  for (int i = 1; i <= n; ++i)
    if (f[i][u] < f[pos[u]][u]) pos[u] = i;
}
void getans(int u, int pre, int lastpos) {
  for (int i = 1; i <= n; ++i) {
    if (e[u][i] && i != pre) {
      if (f[pos[i]][i] > f[lastpos][i] - k)
        ans[i] = lastpos;
      else
        ans[i] = pos[i];
      getans(i, u, ans[i]);
    }
  }
}
int main() {
  memset(dis, 0x3f, sizeof(dis));
  scanf("%d%d", &n, &k);
  for (int i = 1; i < n; ++i) scanf("%d", &cost[i]);
  for (int i = 1; i <= n; ++i) dis[i][i] = 0;
  for (int i = 1; i < n; ++i) {
    static int u, v;
    scanf("%d%d", &u, &v);
    e[u][v] = e[v][u] = 1;
    dis[u][v] = dis[v][u] = 1;
  }
  for (int k = 1; k <= n; ++k)
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j)
        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
  dfs(1, 0);
  printf("%d\n", f[ans[1] = pos[1]][1]);
  getans(1, 0, pos[1]);
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  puts("");
  return 0;
}
