#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn dfs(node: usize, nodes: &Vec<Vec<usize>>, depth: usize, visited: &mut BTreeSet<usize>) -> (usize, usize, Vec<usize>) {
    let mut mx = 0;
    let mut mnode = 0;
    let mut mpath = Vec::new();
    let mut uflag = false;
    for &next in &nodes[node] {
        if visited.contains(&next) {
            continue;
        }
        uflag = true;
        visited.insert(next);
        let (ndep, nnode, path) = dfs(next, nodes, depth+1, visited);
        if ndep > mx {
            mx = ndep;
            mnode = nnode;
            mpath = path;
        }
    }
    if uflag {
        mpath.push(node);
        (mx,mnode, mpath)
    } else {
        (depth, node, vec![node])
    }
}

fn solve() {
    let n = get!(usize);
    let ab = get!(usize, usize;n-1);
    let mut c = get!([usize]);
    c.sort();
    let m = c.iter().take(n-1).sum::<usize>();
    let mut nodes = vec![Vec::new();n+1];
    for (a,b) in ab {
        nodes[a].push(b);
        nodes[b].push(a);
    }
    let (_, node, _) = dfs(1, &nodes, 0, &mut BTreeSet::new()); 
    let (diameter, _, path) = dfs(node, &nodes, 0, &mut BTreeSet::new()); 

    let root = path[diameter/2];
    let mut vals = vec![0; n+1];
    let mut queue = VecDeque::new();
    let mut visited = BTreeSet::new();
    queue.push_back(root);
    visited.insert(root);

    while let Some(node) = queue.pop_front() {
        vals[node] = c.pop().unwrap();
        for &next in &nodes[node] {
            if visited.contains(&next) {
                continue;
            }
            queue.push_back(next);
            visited.insert(next);
        }
    }
    println!("{}", m);
    for e in vals.into_iter().skip(1) {
        print!("{} ", e);
    }
    println!("");
}


Measured memory_bytes: 10620