#include <bits/stdc++.h>
using namespace std;
const int NR = 180 + 10;
int n, m, w[NR];
int d[NR][NR], f[NR][NR], g[NR], ans[NR];
int ecnt = 0, first[NR];
struct Edge {
  int to, nxt;
  Edge(int to = 0, int nxt = 0) { this->to = to, this->nxt = nxt; }
} e[NR << 1];
void addE(int u, int v) {
  e[++ecnt] = Edge(v, first[u]);
  first[u] = ecnt;
}
void dfs(int now, int fou) {
  for (int i = 1; i <= n; i++) f[i][now] = w[d[i][now]] + m;
  for (int i = first[now]; i; i = e[i].nxt) {
    int t = e[i].to;
    if (t == fou) continue;
    dfs(t, now);
    for (int j = 1; j <= n; j++) f[j][now] += min(f[g[t]][t], f[j][t] - m);
  }
  g[now] = 1;
  for (int i = 1; i <= n; i++)
    if (f[i][now] < f[g[now]][now]) g[now] = i;
}
void getAns(int now, int fou, int cur) {
  for (int i = first[now]; i; i = e[i].nxt) {
    int t = e[i].to;
    if (t == fou) continue;
    if (f[cur][t] - m < f[g[t]][t]) {
      ans[t] = cur;
      getAns(t, now, cur);
    } else {
      ans[t] = g[t];
      getAns(t, now, g[t]);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(0);
  memset(d, 999999, sizeof(f));
  cin >> n >> m;
  for (int i = 1; i <= n; i++) d[i][i] = 0;
  for (int i = 1; i < n; i++) cin >> w[i];
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    addE(u, v), addE(v, u);
    d[u][v] = d[v][u] = 1;
  }
  for (int k = 1; k <= n; k++)
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
  dfs(1, 0);
  ans[1] = g[1];
  getAns(1, 0, g[1]);
  cout << f[g[1]][1] << endl;
  for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
  return 0;
}
