//code by Emissary
#include<bits/stdc++.h>

#define fi first
#define se second
#define vc vector
#define db double
#define ll long long
#define mk make_pair
#define pb push_back
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

#define int long long

using namespace std;

namespace IO{
	inline int read(){
		int X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(ll x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(ll x){write(x), putchar(32);}
	inline void eprint(ll x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 5e5+5;
const int mod = 998244353;
//const int mod = 1e9+7;

int n, k, de[MAXN], fa[MAXN];
int a[MAXN], head[MAXN], ne[MAXN<<1], to[MAXN<<1], cnt;

ll dis[MAXN], dp[MAXN], pos[MAXN], val[MAXN], g[MAXN];

vc<int> ans;

bool mark[MAXN], Main[MAXN];

inline void paint(int x, int f){
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		mark[to[i]]=1;
	}
	if(pos[x]) paint(pos[x],x);
	return ;
}

inline void add(int x, int y){++cnt;to[cnt]=y;ne[cnt]=head[x];head[x]=cnt;}

inline void dfs1(int x, int f, ll d){
	d+=a[x]; dis[x]=d; fa[x]=f; de[x]=de[f]+1;
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		dfs1(to[i],x,d);
	}
	return ;
}

inline void get(int x){
	if(!x) return ;
	get(fa[x]); sprint(x);
}

inline void solve1(){
	dfs1(1,0,0); ll maxn=0, maxid=0;
	for(int i=1;i<=n;++i) maxn=max(maxn,dis[i]), maxid=dis[i]==maxn?i:maxid;
	eprint(maxn); eprint(de[maxid]); get(maxid);
}

inline void DP(int x, int f){
	ll maxn=0, maxid=0;
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		DP(to[i],x);
		dp[x]+=a[to[i]]; maxn=max(maxn,dp[to[i]]); 
		maxid=dp[to[i]]==maxn?to[i]:maxid;
	}
	dp[x]+=maxn; pos[x]=maxid;
	//cerr << "x=" << x << ' ' << dp[x] << endl;
}

inline void dfs2(int x, int f){
	g[x]+=a[x];
	fa[x]=f; ll maxn=0, maxx=0, maxnid, maxxid;
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		if(dp[to[i]]+a[to[i]]>=maxn) maxx=maxn, maxxid=maxnid, maxn=dp[to[i]]+a[to[i]], maxnid=to[i];
		else if(dp[to[i]]+a[to[i]]>=maxx) maxx=dp[to[i]]+a[to[i]], maxxid=to[i];
	}
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		g[to[i]]=g[x]+(maxnid==to[i]?maxx:maxn); dfs2(to[i],x);
	}
	return ;
}

inline void construct(int x){
	if(!x) return ;
	construct(pos[x]);
	for(int o=head[x];o;o=ne[o]){
		if(to[o]==fa[x] || to[o]==pos[x]) continue;
		ans.pb(to[o]);
	}
	ans.pb(x);
}

inline void solve2(){
	DP(1,0); dfs2(1,0);
	ll maxn=0, maxid=0;
	for(int i=1;i<=n;++i){
		maxn=max(maxn,g[i]);
		maxid=g[i]==maxn?i:maxid;
	}
	vc<int> Ma;
	eprint(maxn); int now=maxid;
	while(now){
		Ma.pb(now); ll maxn=0, maxid=0;
		for(int i=head[now];i;i=ne[i]){
			if(mark[to[i]] || to[i]==fa[now]) continue;
			maxn=max(maxn,dp[to[i]]), maxid=dp[to[i]]==maxn?to[i]:maxid;
		}
		if(maxid) mark[maxid]=1, paint(maxid,now);
		Main[now]=1, mark[now]=1, now=fa[now];	
	}
	int tot=0; reverse(Ma.begin(),Ma.end());
	for(int i=1;i<=n;++i) tot+=mark[i];
	eprint(tot);
	for(auto i:Ma){
		sprint(i);
		for(int j=head[i];j;j=ne[j]){
			if(Main[to[j]] || to[j]==fa[i] || !mark[to[j]]) continue;
			ans.clear(); construct(pos[to[j]]);
			for(int o=head[to[j]];o;o=ne[o]){
				if(to[o]==i || to[o]==pos[to[j]]) continue;
				ans.pb(to[o]);
			}
			ans.pb(to[j]);
			for(auto x:ans) sprint(x);
		}
	}
}

inline void dfs3(int x, int f){
	//cerr << "dfs3:" << x << endl;
	ans.pb(x);
	for(int i=head[x];i;i=ne[i]){
		if(to[i]==f) continue;
		for(int j=head[to[i]];j;j=ne[j]){
			if(to[j]==x) continue;
			dfs3(to[j],to[i]);
		}
		ans.pb(to[i]);
	}
	return ;
}

inline void solve3(){
	ll sum=0;
	for(int i=1;i<=n;++i) sum+=a[i];
	eprint(sum); eprint(n); dfs3(1,0);
	for(auto i:ans) sprint(i);
}

signed main(){
	n=read(); k=read();
	for(int i=2;i<=n;++i){
		int x, y;
		x=read(), y=read();
		add(x,y); add(y,x);
	}
	for(int i=1;i<=n;++i) a[i]=read();
	if(k==1) solve1();
	if(k==2) solve2();
	if(k==3) solve3();
	return 0;
}