#include <bits/stdc++.h>
using namespace std;

#define int long long


typedef array<deque<pair<int,int>>,3> grid;

int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n,m;
	cin >> n >> m;
	vector<int> has_Rest(n+1);
	vector<int> has_Past(n+1);
	vector<vector<int>> adj(n+1);
	for(int i=1;i<=m;i++){
		int a;cin>>a;
		has_Rest[a]=i;
	}
	for(int i=1;i<=m;i++){
		int a;cin>>a;
		has_Past[a]=i;
	}
	for(int i=1;i<n;i++){
		int a,b;cin>>a>>b;
		adj[a].emplace_back(b);
		adj[b].emplace_back(a);
	}
	vector<int> next(2*m+1);
	auto combine = [&](pair<int,int> &a,pair<int,int> &b){
		next[a.second] = b.first;
		return a = {a.first,b.second};
	};
	int ans = 0;
	function<tuple<int,int,grid>(int,int)> dfs = [&](int x,int p)->tuple<int,int,grid>{
		int cntRest = 0;
		int cntPast = 0;
		auto add = [](deque<pair<int,int>> &a,deque<pair<int,int>> &b){
			if(b.size()>a.size())swap(a,b);
			for(auto&i:b)a.push_back(i);
		};
		grid curr;
		if(has_Rest[x]){
			cntRest++;
			curr[0].emplace_back(has_Rest[x],has_Rest[x]);
		}
		if(has_Past[x]){
			cntPast++;
			curr[1].emplace_back(has_Past[x]+m,has_Past[x]+m);
		}
		for(int&j:adj[x])if(j!=p){
			auto [a,b,c] = dfs(j,x);
			cntRest+=a;
			cntPast+=b;
			add(curr[0],c[0]);
			add(curr[1],c[1]);
			add(curr[2],c[2]);
		}
		if(cntPast==0 and cntRest==0)return {0,0,curr};
		if(cntPast>cntRest){
			for(auto&j:curr[2]){
				combine(curr[1].front(),j);
			}
			for(int j=0;j<curr[0].size();j++){
				combine(curr[1][j],curr[0][j]);
				if(j)combine(curr[1][j],curr[1][j-1]);
			}
			if(curr[0].size())curr[1][curr[0].size()] = combine(curr[1][curr[0].size()-1],curr[1][curr[0].size()]);
			grid currn;
			swap(currn[1],curr[1]);
			for(int j=0;j<curr[0].size();j++){
				currn[1].pop_front();
			}
			ans+=currn[1].size()*2;
			return {cntRest,cntPast,move(currn)};
		}
		if(cntRest>cntPast){
			for(auto&j:curr[2]){
				curr[0].front() = combine(j,curr[0].front());
			}
			for(int j=0;j<curr[1].size();j++){
				combine(curr[0][j],curr[1][j]);
				if(j)combine(curr[0][j],curr[0][j-1]);
			}
			if(curr[1].size())curr[0][curr[1].size()] = combine(curr[0][curr[1].size()-1],curr[0][curr[1].size()]);
			grid currn;
			swap(currn[0],curr[0]);
			for(int j=0;j<curr[1].size();j++){
				currn[0].pop_front();
			}
			ans+=currn[0].size()*2;
			return {cntRest,cntPast,move(currn)};
		}
		for(int j=1;j<curr[2].size();j++){
			combine(curr[2].front(),curr[2][j]);
		}
		for(int j=0;j<curr[0].size();j++){
			combine(curr[0][j],curr[1][j]);
			if(j)combine(curr[0][j],curr[0][j-1]);
		}
		grid currn;
		if(curr[2].empty())currn[2].emplace_back(curr[0].back());
		else if(curr[0].empty())currn[2].emplace_back(curr[2].front());
		else currn[2].emplace_back(combine(curr[0].back(),curr[2].front()));
		ans+=2;
		return {cntRest,cntPast,move(currn)};
	};
	auto [a,b,c] = dfs(1,0);
	ans-=2;
	cout << ans << '\n';
	function<void(int)> ddfs = [&](int x){
		cout << (x-1)%m + 1 << ' ';
		if(c[2][0].second==x)return;
		ddfs(next[x]);
	};
	ddfs(c[2][0].first);
	cout << '\n';
}