#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll inf=-1e18;
struct matrix{
	int n,m;
	ll arr[3][3];
	void init(ll v0,ll v1){
		n=m=2;
		arr[1][1]=v0,arr[2][1]=v1;
		arr[1][2]=v0,arr[2][2]=inf;
	}
	void init1(){
		n=m=2;
		arr[1][1]=inf,arr[1][2]=inf;
		arr[2][1]=inf,arr[2][2]=inf;
	}
	void init2(ll v){
		n=2,m=1;
		arr[1][1]=0,arr[2][1]=v;
	}
	void leaf(){
		n=m=2;
		arr[1][1]=arr[2][2]=0;
		arr[1][2]=arr[2][1]=inf;
	}
};
matrix mul(matrix a,matrix b){
	matrix c;
	c.init1();
	c.n=a.n,c.m=b.m;
	for(int k=1;k<=a.m;k++)
		for(int i=1;i<=a.n;i++)
			for(int j=1;j<=b.m;j++)
				c.arr[i][j]=max(c.arr[i][j],a.arr[i][k]+b.arr[k][j]);
	return c;
}
struct node{
	int l,r;
	matrix val;
}Tree[800005];
int dep[200005],siz[200005],nid[200005],son[200005],top[200005],tot,fath[200005];
ll dp[200005][2],g[200005][2];
int px[200005],ed[200005],n,q;
vector<int>vec[200005];
void ztree(int p,int l,int r){
	Tree[p].l=l,Tree[p].r=r;
	if(l==r){
		if(vec[px[l]].size()==1&&px[l]!=1)Tree[p].val.leaf();
		else Tree[p].val.init(g[px[l]][0],g[px[l]][1]);
		return;
	}
	int mid=l+r>>1;
	ztree(p*2,l,mid);
	ztree(p*2+1,mid+1,r);
	Tree[p].val=mul(Tree[p*2].val,Tree[p*2+1].val);
}
void update(int p,int l,ll v1,ll v2){
	if(Tree[p].l==Tree[p].r){
		Tree[p].val.init(v1,v2);
		return;
	}
	int mid=Tree[p].l+Tree[p].r>>1;
	if(l<=mid)update(p*2,l,v1,v2);
	else update(p*2+1,l,v1,v2);
	Tree[p].val=mul(Tree[p*2].val,Tree[p*2+1].val);
}
matrix Get(int p,int l,int r){
	if(l<=Tree[p].l&&Tree[p].r<=r)return Tree[p].val;
	int mid=Tree[p].l+Tree[p].r>>1;
	matrix ans;
	bool f=0;
	if(l<=mid)f=1,ans=Get(p*2,l,r);
	if(r>mid){
		if(f)ans=mul(ans,Get(p*2+1,l,r));
		else ans=Get(p*2+1,l,r);
	}
	return ans;
}
void dfs1(int now,int fa,int d){
	dep[now]=d;
	fath[now]=fa;
	son[now]=0,siz[now]=1;
	int maxx=0;
	for(auto to:vec[now]){
		if(to==fa)continue;
		dfs1(to,now,d+1);
		siz[now]+=siz[to];
		if(maxx<siz[to])maxx=siz[to],son[now]=to;
	}
}
void dfs2(int now,int tp){
	top[now]=tp;
	nid[now]=++tot;
	px[tot]=now;
	if(son[now])dfs2(son[now],tp),ed[now]=ed[son[now]];
	else ed[now]=now;
	for(auto to:vec[now]){
		if(to==fath[now]||to==son[now])continue;
		dfs2(to,to);
	}
}
ll L[200005],R[200005],a[200005];
void dfs(int now){
	g[now][0]=0,g[now][1]=a[now];
	for(auto to:vec[now]){
		if(to!=fath[now]){
			dfs(to);
			if(to!=son[now])g[now][0]+=max(dp[to][0],dp[to][1]),g[now][1]+=dp[to][0];
		}
	}
	dp[now][1]=g[now][1]+dp[son[now]][0];
	dp[now][0]=g[now][0]+max(dp[son[now]][1],dp[son[now]][0]);
//	cout<<now<<" "<<dp[now][0]<<" "<<dp[now][1]<<" "<<a[now]<<endl;
}
ll upd1(int x,ll y){
	matrix old,nw;
	matrix c;
	c.init2(a[ed[x]]);
	old=mul(Get(1,nid[top[x]],nid[ed[x]]),c);
	if(vec[x].size()>1||x==1)update(1,nid[x],g[x][0],y-a[x]+g[x][1]);
	g[x][1]+=y-a[x];
	a[x]=y;
	c.init2(a[ed[x]]);
	nw=mul(Get(1,nid[top[x]],nid[ed[x]]),c);
	while(1){
		if(top[x]==1)break;
		x=fath[top[x]];
		c.init2(a[ed[x]]);
		g[x][0]-=max(old.arr[1][1],old.arr[2][1])-max(nw.arr[1][1],nw.arr[2][1]);
		g[x][1]-=old.arr[1][1]-nw.arr[1][1];
		old=mul(Get(1,nid[top[x]],nid[ed[x]]),c);
		c.init2(a[ed[x]]);
		update(1,nid[x],g[x][0],g[x][1]);
		nw=mul(Get(1,nid[top[x]],nid[ed[x]]),c);
	}
	return max(nw.arr[1][1],nw.arr[2][1]);
}
struct qry{
	int id;
	ll val;
}ask[200005];
bool cmp(qry x,qry y){
	return x.val<y.val;
}
ll ans[200005],cs[200005];
int pos[200005];
int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>n>>q;
		ll A,B,mod;
		cin>>A>>B>>mod;
		for(int i=1;i<=n;i++)vec[i].clear();
		for(int i=1;i<n;i++){
			int x,y;
			cin>>x>>y;
			vec[x].push_back(y);
			vec[y].push_back(x);
		}
		for(int i=1;i<=n;i++)cin>>L[i]>>R[i],a[i]=L[i];
		for(int i=1;i<=q;i++)cin>>ask[i].val,ask[i].id=i;
		sort(ask+1,ask+1+q,cmp);
		tot=0;
		dfs1(1,1,1);
		dfs2(1,1);
		dfs(1);
		ztree(1,1,tot);
		ll cmax=max(dp[1][0],dp[1][1]);
//		cout<<cmax<<endl;
		int cur=1;
		while(cur<=q&&ask[cur].val<cmax)ans[ask[cur++].id]=-1;
		ll xo=0;
		for(int i=1;i<=n;i++)xo^=((A*i+B*L[i]%mod*L[i])%mod); 
		while(cur<=q&&ask[cur].val==cmax)pos[ask[cur].id]=1,cs[ask[cur].id]=L[1],ans[ask[cur++].id]=xo;
		for(int i=1;i<=n;i++){
			ll tmx=upd1(i,R[i]);
			xo^=((A*i+B*L[i]%mod*L[i])%mod);
			while(cur<=q&&ask[cur].val<=tmx){
				ll u=ask[cur].val-cmax;
				ll csi=R[i]-tmx+ask[cur].val;
				pos[ask[cur].id]=i,cs[ask[cur].id]=csi;
				ans[ask[cur++].id]=(xo^((A*i+B*csi%mod*csi)%mod));
			}
			cmax=tmx;
			xo^=((A*i+B*R[i]%mod*R[i])%mod);
		}
		while(cur<=q)ans[ask[cur++].id]=-1;
		for(int i=1;i<=q;i++)cout<<ans[i]<<" ";
		cout<<endl;
		while(1){
			int x;
			cin>>x;
			if(x==0)break;
			if(ans[x]==-1){
				cout<<-1<<endl;
				continue;
			}
			for(int i=1;i<pos[x];i++)cout<<R[i]<<" ";
			cout<<cs[x]<<" ";
			for(int i=pos[x]+1;i<=n;i++)cout<<L[i]<<" ";
			cout<<endl;
		}
	}
	return 0;
}