#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

#define int long long

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 2e5 + 5;

int n, k, ans, pos, fa[N], a[N], nxt[N], f[N], g[N]; 
vc<int> G[N], chain, path;

inline void dfs1(int x) {
	int sum = a[x], u = 0;
	for(auto y : G[x]) if(y != fa[x]) {
		fa[y] = x; dfs1(y); sum += a[y]; u = 0;
		for(auto z : G[y]) if(z != x && f[z] > f[u]) u = z;
		if(u && f[u] > f[x]) g[x] = f[x], f[x] = f[u], nxt[x] = y;
		else if(u && f[u] > g[x]) g[x] = f[u]; 
	}
	f[x] += sum; g[x] += sum;
}

inline void dfs2(int x, int tot) {
	if(tot + a[x] > ans) ans = tot + a[x], pos = x;
	for(auto y : G[x]) if(y != fa[x]) {
		int val = nxt[x] == y ? g[x] : f[x];
		dfs2(y, tot + val - a[y]);
	}
}

inline void construct(int x) {
	path.pb(x);
	if(nxt[x]) construct(nxt[x]);
	for(auto y : G[x]) if(y != fa[x]) path.pb(y);
}

signed main() {
	n = read(); k = read(); 
	for(int i = 1, u, v; i < n; i++) 
		u = read(), v = read(), G[u].pb(v), G[v].pb(u);
	rep(i, 1, n) a[i] = read();
	
	dfs1(1); dfs2(1, 0); 
	cout << ans << endl;
	
	for(int x = pos; x; x = fa[x]) chain.pb(x);
	reverse(chain.begin(), chain.end()); chain.pb(0);
	
	path.pb(1);
	for(int i = 0, x, y, u; i + 1 < chain.size(); i++) {
		x = chain[i]; y = chain[i + 1]; u = 0;
		for(auto z : G[x]) if(z != y && z != fa[x]) 
			for(auto v : G[z]) if(v != fa[z] && f[v] > f[u]) u = v;
		if(u) construct(u);
		for(auto z : G[x]) if(z != y && z != fa[x]) path.pb(z);
		if(y) path.pb(y);
	}
	
	printf("%lld\n", (int)path.size());
	for(auto u : path) printf("%lld ", u); putchar(10);
	return 0;
}