#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
   return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
   os << "[";
   bool a = 1;
   for (auto e : v ) {
      os << (a ? "" : " "); 
      os << e;
      a = 0;
   }
   os << "]";
   return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
   os << "(" << p.first << " " << p.second << ")";
   return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
   os << "{";
   bool a = 1;
   for (auto e : st) {
      os << (a ? "" : " ");
      os << e;
      a = 0;
   }
   os << "}";
   return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
   os << "{";
   bool a = 1;
   for (auto e : mp) {
      os << (a ? "" : " ");
      os << e.first << ":" << e.second;
      a = 0;
   }
   os << "}";
   return os;
}

// std::tuple Debug
template<int N,class Tuple>
void out(ostream& os,const Tuple& t){}
template<int N,class Tuple,class H,class ...Ts>
void out(ostream& os,const Tuple& t){
   if(N)os<<" ";
   os<<get<N>(t);
   out<N+1,Tuple,Ts...>(os,t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t){
   os<<"(";
   out<0,tuple<Ts...>,Ts...>(os,t);
   os<<")";
   return os;
}

// Debug
#define DUMP(x) cout<<#x<<" = "<<(x)<<endl


struct edge { int to, cost; };

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

void topological_sort(const vector<vector<int>>& G, vector<int>& ord)
{
   vector<int> num(G.size(),0);
   ord.resize(G.size());
   for (int i = 0; i < G.size(); ++i) {
      for (int j = 0; j < G[i].size(); ++j) {
         ++num[G[i][j]];
      }
   }
   stack<int> st;
   for(int i = 0; i < num.size(); ++i) {
      if (num[i] == 0) {
         st.push(i);
      }
   }
   for (int k = 0; !st.empty(); ++k) {
      int i = st.top(); st.pop();
      ord[k] = i;
      for(int j = 0; j < G[i].size(); ++j) {
         --num[G[i][j]];
         if (num[G[i][j]] == 0) {
            st.push(G[i][j]);
         }
      }
   }
}

void dfs(const auto& G, auto& g, int v, int p) {
   for (int i = 0; i < G[v].size(); ++i) {
      int to = G[v][i];
      if (to == p) continue;
      g[v].push_back(to);
      dfs(G, g, to, v);
   }
}


int main()
{
   int n; cin >> n;
   vector<int> a(n-1), b(n-1);
   for (int i = 0; i < n-1; ++i) {
      cin >> a[i] >> b[i];
      --a[i]; --b[i];
   }

   vector<int> c(n);
   for (int i = 0; i < n; ++i) {
      cin >> c[i];
   }

   vector<vector<int>> G(n);
   for (int i = 0; i < n-1; ++i) {
      G[a[i]].push_back(b[i]);
      G[b[i]].push_back(a[i]);
   }

   vector<vector<int>> g(n);
   dfs(G, g, 0, -1);
   swap(G, g);

   vector<int> ord;
   topological_sort(G, ord);

   sort(c.begin(), c.end());

   vector<int> ans(n);
   LL sum = 0;
   for (int i = 0; i < n; ++i) {
      ans[ord[n-1-i]] = c[i];
      if (i != n-1) sum += c[i];
   }

   cout << sum << endl;
   for (int i = 0; i < n; ++i) {
      cout << ans[i] << (i == n-1 ? "\n" : " ");
   }

   return 0;
}


Measured memory_bytes: 2432