#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const std::vector<std::pair<int, int>> DXDY = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
constexpr char BR = '\n';

#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
#define ALL(A) (A).begin(), (A).end()
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class S, class T> inline void chmax(S &a, T b){if(a < b) a = b;}
template <class S, class T> inline void chmin(S &a, T b){if(a > b) a = b;}
template <class T> inline void reverseSORT(Vec<T> &Array){
  std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1LL << k;}
inline void putsDouble(double d){printf("%.16lf\n", d);}
inline int toInt(const string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res;
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~






int main(void){
    int n; scanf("%d", &n);
    Wint Edge(n, Vint(0));
    REP(i, n-1){
        int a, b; scanf("%d%d", &a, &b); a--; b--;
        Edge[a].emplace_back(b);
        Edge[b].emplace_back(a);
    }
    Vint Cs(n); REP(i, n) scanf("%d", &Cs[i]); SORT(Cs);

    Vint Cost(n, -1);
    std::queue<int> Q; Q.push(0); Cost[0] = 0;
    while(not Q.empty()){
        int v = Q.front(); Q.pop();
        vREP(ele, Edge[v]) if(Cost[ele] == -1){
            Cost[ele] = Cost[v] + 1;
            Q.push(ele);
        }
    }
    int mx = -1, argmx = -1;
    // 0 からの最大距離
    REP(i, n) if(Cost[i] > mx){
        mx = Cost[i]; argmx = i;
    }
    std::fill(ALL(Cost), -1);
    Q.push(argmx); Cost[argmx] = 0;
    while(not Q.empty()){
        int v = Q.front(); Q.pop();
        vREP(ele, Edge[v]) if(Cost[ele] == -1){
            Cost[ele] = Cost[v] + 1;
            Q.push(ele);
        }
    }
    int mx2 = -1, argmx2 = -1;
    //  からの最大距離
    REP(i, n) if(Cost[i] > mx2){
        mx2 = Cost[i]; argmx2 = i;
    }

    Vint NE(n, -1); lli res = 0;
    if(mx2 % 2 == 1){
        int center1 = argmx2, center2 = argmx2;
        while(Cost[center1] != mx2 / 2){
            vREP(ele, Edge[center1]) if(Cost[center1] - Cost[ele] == 1){
                center2 = center1;
                center1 = ele;
                break;
            }
        }
        Q.push(center1); Q.push(center2);
        NE[center1] = Cs[n-1]; NE[center2] = Cs[n-2]; int idx = n-3; res += Cs[n-2];
        while(not Q.empty()){
            int a = Q.front(); Q.pop();
            vREP(ele, Edge[a]) if(NE[ele] == -1){
                NE[ele] = Cs[idx];
                Q.push(ele);
                res += Cs[idx];
                idx--;
            }
        }
    }
    else{
        int center = argmx2;
        while(Cost[center] != mx2 / 2){
            vREP(ele, Edge[center]) if(Cost[center] - Cost[ele] == 1){
                center = ele;
                break;
            }
        }
        Q.push(center);
        NE[center] = Cs[n-1]; int idx = n-2;
        while(not Q.empty()){
            int a = Q.front(); Q.pop();
            vREP(ele, Edge[a]) if(NE[ele] == -1){
                NE[ele] = Cs[idx];
                Q.push(ele);
                res += Cs[idx];
                idx--;
            }
        }
    }
    printf("%lld\n", res);
    REP(i, n-1) printf("%d ", NE[i]); printf("%d\n", NE[n-1]);
    return 0;
}

Measured memory_bytes: 1024