#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
#include <queue>

#define pv(val) cerr << #val << '=' << (val) << endl
#define pvn(name, val) cerr << name << '=' << (val) << endl
#define pl cerr << '@' << __LINE__ << endl

using namespace std;

using ll = int64_t;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

template <class T>
ostream &operator<<(ostream &os, vector<T> const &vec) {
    if (vec.empty()) {
        os << "{}";
    } else {
        os << '{';
        for (size_t i = 0; i < vec.size() - 1; i++) os << vec[i] << ", ";
        os << vec.back() << '}';
    }
    return os;
}

template <class T, size_t S>
ostream &operator<<(ostream &os, array<T, S> const &arr) {
    if (arr.empty()) {
        os << "{}";
    } else {
        os << '{';
        for (size_t i = 0; i < arr.size() - 1; i++) os << arr[i] << ", ";
        os << arr.back() << '}';
    }
    return os;
}

template <class T, class U>
ostream &operator<<(ostream &os, pair<T, U> const &p) {
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

namespace math {
ll gcd(ll u, ll v) {
    while (v != 0) {
        ll r = u % v;
        u = v;
        v = r;
    }
    return u;
}
ll lcm(ll m, ll n) {
    if ((0 == m) || (0 == n)) return 0;

    return ((m / math::gcd(m, n)) * n);
}
}  // namespace math

struct UnionFind {
    vector<ll> data;
    UnionFind(ll size) : data(size, -1) {}
    bool unionSet(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y];
            data[y] = x;
        }
        return x != y;
    }
    bool findSet(ll x, ll y) { return root(x) == root(y); }
    ll root(ll x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    ll size(ll x) { return -data[root(x)]; }
};

template <class T, class U>
pair<T, U> operator+(pair<T, U> const &a, pair<T, U> const &b) {
    return pair<T, U>(a.first + b.first, a.second + b.second);
}

template <class T, class U>
pair<T, U> operator-(pair<T, U> const &a, pair<T, U> const &b) {
    return pair<T, U>(a.first - b.first, a.second - b.second);
}

ll bound(function<bool(ll)> f, ll ng, ll ok) {
    while (abs(ng - ok) > 1) {
        ll mid = (ng + ok) / 2;
        if (f(mid))
            ok = mid;
        else
            ng = mid;
    }

    return ok;
}


int main(void) {
    ll N;
    cin >> N;
    vector<vector<ll>> graph(N);

    rep(i, N - 1) {
        ll a, b;
        cin >> a >> b;
        pv(a);
        pv(b);
        --a, --b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    priority_queue<ll> c;
    rep(i, N) {
        ll cc;
        cin >> cc;
        pv(cc);
        c.push(cc);
    }

    queue<ll> a;

    vector<bool> visited(N, false);
    vector<ll> ans(N, -1);
    a.push(0);
    while (!a.empty()) {
        ll const u = a.front();
        a.pop();

        if (visited[u])
            continue;

        visited[u] = true;

        ans[u] = c.top();
        c.pop();

        for (ll v : graph[u])
            a.push(v);
    }

    fill(all(visited), false);

    ll M = 0;
    a.push(0);
    while (!a.empty()) {
        ll const u = a.front();
        a.pop();

        if (visited[u])
            continue;
        visited[u] = true;

        for (ll v : graph[u]) {
            if (visited[v])
                continue;
            M += min(ans[u], ans[v]);
            a.push(v);
        }
    }

    cout << M << endl;
    rep(i, N)
        cout << ans[i] << ' ';
    cout << endl;


    return 0;
}


Measured memory_bytes: 1272