import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] A, B;
long[] C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new int[N - 1];
      B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      C = new long[N];
      foreach (j; 0 .. N) {
        C[j] = readLong();
      }
      C.sort;
      
      auto graph = new int[][N];
      foreach (i; 0 .. N - 1) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      auto deg = new int[N];
      foreach (u; 0 .. N) {
        deg[u] = cast(int)(graph[u].length);
      }
      
      alias Entry = Tuple!(int, "deg", int, "u");
      auto q = new RedBlackTree!Entry();
      foreach (u; 0 .. N) {
        q.insert(Entry(deg[u], u));
      }
      auto vis = new bool[N];
      long sum;
      auto ans = new long[N];
      foreach (j; 0 .. N) {
        const u = q.front.u;
        q.removeFront;
        vis[u] = true;
        sum += deg[u] * C[j];
        ans[u] = C[j];
        foreach (v; graph[u]) {
          if (!vis[v]) {
            q.removeKey(Entry(deg[v], v));
            --deg[v];
            q.insert(Entry(deg[v], v));
          }
        }
      }
      writeln(sum);
      foreach (u; 0 .. N) {
        if (u > 0) {
          write(" ");
        }
        write(ans[u]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}
