Language: C++

#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int,int>
#define twol pair<ll,ll>
#define four pair<two,two>
#define pb push_back
#define mk make_pair
#define y1 y1922
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<int>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (int)(container.size())
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mid(a,b) (a+b>>1)
#define minN 0
#define maxN 10000000
#define na(x) ((x)<P?(x):(x)-P)
#define ab(a) (-(a)<(a)?(a):-(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef
tree<
  int,// aq pair<int,int> shegidzlia
  null_type,
  less/*_equal*/<int>,// aqac
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template<class key, class value,class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<int, int> my_map;
inline int rin(){
	int x=0,w=1;char ch=getchar();
	while ((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
	if (ch=='-') w=0,ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return w?x:-x;
}
inline int bin(){
	int x=0;char ch=getchar();
	while (ch<'0'||ch>'9') ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return x;
}
int n,a,b,c[10004],fix[10004],ans,answer,ANS[10004];
multiset<int>S;
multiset<int>::IT it;
vector<int>v[10004];
void cnt(int sad,int saidan){
	for(int i=0;i<sz(v[sad]);i++){
		if(v[sad][i]==saidan) continue;
		ans+=min(fix[v[sad][i]],fix[sad]);
		cnt(v[sad][i],sad);
	}
}
inline maxima(int ans){
	if(ans>answer){
		for(int i=1;i<=n;i++){
			ANS[i]=fix[i];
		}
		answer=ans;
	}
}
inline void work(int s){
	memset(fix,0,sizeof fix);
	it=S.begin();
	fix[s]=-(*it);
	S.erase(it);
	queue<int>q;
	q.push(s);
	while(!q.empty()){
		a=q.front();
		q.pop();
		for(int i=0;i<sz(v[a]);i++){
			if(fix[v[a][i]]==0){
				q.push(v[a][i]);
				it=S.begin();
				fix[v[a][i]]=-(*it);
				S.erase(it);
			}
		}
	}
	ans=0;
}
int main(){FAST;xRand;
cin>>n;
for(int i=0;i<n-1;i++){
	cin>>a>>b;
	v[a].pb(b);
	v[b].pb(a);
}
for(int i=1;i<=n;i++){
	cin>>c[i];
}
for(int i=1;i<=n;i++){
	S.clear();
	for(int i=1;i<=n;i++){
		S.insert(-c[i]);
	}
	work(i);
	cnt(1,-1);
//	cout<<ans<<endl;
	maxima(ans);
}
cout<<answer<<endl;
for(int i=1;i<=n;i++){
	cout<<ANS[i]<<" ";
}
cout<<endl;
}
/*

                   *         *
                  * *       * *
                 *   *     *   *
                *     *   *     *
                 *   *   * *   *
                  *   *   *   *
                   *   * *   *
                     *  *   *
					   *  *


*/






Compiler output:
a.cc:78:8: error: ISO C++ forbids declaration of 'maxima' with no type [-fpermissive]
   78 | inline maxima(int ans){
      |        ^~~~~~
a.cc: In function 'int maxima(int)':
a.cc:85:1: warning: no return statement in function returning non-void [-Wreturn-type]
   85 | }
      | ^