#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

#pragma GCC target("avx,avx2")
using namespace std;



const int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	return Mod(a) / b;
}
Mod operator/=(Mod &a, const Mod b) {
	return a = a / b;
}

#define MAX_MOD_N 202400

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init(const int amax = MAX_MOD_N) {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < amax - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}
    
void solve(){
  int N;cin>>N;
  vector<vector<int>>edges(N);
  
  for(int i=0;i<N-1;++i){
    int a,b;cin>>a>>b;
    a--;b--;
    edges[a].push_back(b);
    edges[b].push_back(a);
  }
  vector<int>nums(N);
  for(int i=0;i<N;++i){
    cin>>nums[i];
  }

  vector<int>anss(N);
  sort(nums.begin(),nums.end());
  queue<int>que;
  for(int i=0;i<N;++i){
    if(edges[i].size()==1){
      que.emplace(i);
    }
  }
  //cout<<que.size()<<endl;
  auto it=nums.begin();
  while(!que.empty()){
    int place=que.front();
    que.pop();
    //cout<<place<<endl;
    anss[place]=*it;
    it++;
    if(edges[place].size()==0){
      break;
    }
    assert(edges[place].size()==1);
    int e=edges[place][0];
    edges[place].clear();
    edges[e].erase(find(edges[e].begin(),edges[e].end(),place));
    if(edges[e].size()==1){
      que.emplace(e);
    }
  }
  int sum=accumulate(nums.begin(),prev(nums.end()),0);
  cout<<sum<<endl;
  for(int i=0;i<N;++i){
    cout<<anss[i]<<" ";
  }
  cout<<endl;

}

int main(void){
  solve();

  return 0;
}

Measured memory_bytes: 2560