#input of int(split by space)
def get_i()
  return gets.chomp.split(" ").map(&:to_i)
end
#input of float(split by space)
def get_f()
  return gets.chomp.split(" ").map(&:to_f)
end
#input of string(split by space)
def get()
  return gets.chomp.split(" ")
end
#input of string(split per one character)
def get_nsp()
  return gets.chomp.split("")
end
#yes or no decision
def yn_judge(bool,y="Yes",n="No")
  return bool ? y : n 
end
#create of array
def array(size1,init=nil,size2=-1)
  if size2==-1
      return Array.new(size1){init}
  else
      return Array.new(size2){Array.new(size1){init}}
  end
end

def max(a,b)
    return a>b ? a : b
end

def min(a,b)
    return a>b ? b : a
end

INF=Float::INFINITY

N=gets.to_i
g=Array.new(N){[]}
def bfs(g,c)
    que=[0]
    cost=array(N,-1)
    cost[0]=c[0]
    ret=0
    i=1
    until que==[]
        p=que.shift
        g[p].each do|v|
            next unless cost[v]==-1
            cost[v]=c[i]
            i+=1
            ret+=min(cost[p],cost[v])
            que.push(v)
        end
    end
    return ret
end
size=Hash.new(0)
(N-1).times do|i|
  a,b=get_i.map{|x| x-=1}
  g[a].push(b)
  g[b].push(a)
end
c=get_i.sort{|x,y| y<=>x}
puts bfs(g,c)
puts c.join(" ")