#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e3+5,M=N*N+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,q,x,y,z,id[N][N],Ct;vector<int> S[N];
struct yyy{int to,z;};struct ljb{int head,h[N*N];yyy f[N*N*4];void add(int x,int y){f[++head]=(yyy){y,h[x]};h[x]=head;/*cerr<<x<<' '<<y<<'\n';*/}}s;
int fa[N],d[N],tp[N],siz[N],son[N],is[N],df[N],ih;
int g[N];
int ans[N][N],vis[N][N];
void dfs1(int v,int La,int is){
	for(int i:S[v]) if(i^La) dfs1(i,v,is),g[v]+=g[i];
	if(!g[v]) ans[is][v]=1;
	else if(g[v]==x&&v^1) ans[is][v]=0;
	// else cerr<<v<<' '<<g[v]<<'\n';
}
int f[N][N];
int GF(int x,int *fa){return fa[x]^x?fa[x]=GF(fa[x],fa):x;}
vector<int> scs;
namespace Tree{
	#define ls v<<1
	#define rs v<<1|1
	int fa[N*4][N];
	void build(int l=1,int r=n,int v=1){
		iota(fa[v]+1,fa[v]+m+1,1);if(l==r) return;
		int m=l+r>>1;build(l,m,ls);build(m+1,r,rs);
	}
	void add(int x,int y,int l=1,int r=n,int v=1){
		// cerr<<x<<' '<<y<<' '<<z1<<' '<<z2<<'\n';
		if(x<=l&&r<=y) {scs.emplace_back(v);return;}
		int m=l+r>>1;x<=m&&(add(x,y,l,m,ls),0);y>m&&(add(x,y,m+1,r,rs),0);
	}
	void push(int l=1,int r=n,int v=1){
		if(l==r) {Mc(f[df[l]],fa[v]);return;}
		for(int i=1;i<=m;i++) if(GF(i,fa[v])^i){
			fa[ls][GF(i,fa[ls])]=GF(fa[v][i],fa[ls]);
			fa[rs][GF(i,fa[rs])]=GF(fa[v][i],fa[rs]);
		}
		int m=l+r>>1;push(l,m,ls);push(m+1,r,rs);
	}
	void merge(int v,int z1,int z2){fa[v][GF(z1,fa[v])]=GF(z2,fa[v]);}
}
void make1(int x,int La){
	fa[x]=La;d[x]=d[La]+1;siz[x]=1;
	for(int i:S[x]) if(i^La) make1(i,x),siz[x]+=siz[i],siz[i]>siz[son[x]]&&(son[x]=i);
}
void make2(int x,int La){
	tp[x]=La;is[x]=++ih;df[ih]=x;if(son[x]) make2(son[x],La);
	for(int i:S[x]) if(i^fa[x]&&i^son[x]) make2(i,i);
}
int LCA(int x,int y){
	while(tp[x]^tp[y]) d[tp[x]]<d[tp[y]]&&(swap(x,y),0),x=fa[tp[x]];
	return d[x]<d[y]?x:y;
}
void merge(int x,int y){
	// cerr<<z1<<' '<<z2<<' '<<x<<' '<<y<<'\n';
	while(tp[x]^tp[y]) Tree::add(is[tp[y]],is[y]),y=fa[tp[y]];
	if(x^y) Tree::add(is[x]+1,is[y]);
}
void tarjan(int x,int y,int w){
	// cerr<<x<<' '<<y<<' '<<w<<'\n';
	if(~ans[x][y]&&ans[x][y]^w){puts("-1");exit(0);}
	if(vis[x][y]) return;vis[x][y]=1;ans[x][y]=w;
	for(int j=s.h[id[x][y]],i=s.f[j].to;j;j=s.f[j].z,i=s.f[j].to) tarjan(i,y,w);
	if(w){
		for(int i:S[y]) if(i^fa[y]) tarjan(x,i,1);
	}else{
		for(int i:S[fa[y]]) if(i^y) tarjan(x,i,i!=fa[fa[y]]);
	}
}
void Solve(){
	int i,j;scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<n;i++){
		scanf("%d%d",&x,&y);
		S[x].emplace_back(y);S[y].emplace_back(x);
	}
	for(i=1;i<=m;i++) for(j=1;j<=n;j++) id[i][j]=++Ct,ans[i][j]=-1;
	for(i=1;i<=m;i++){
		Me(g,0);scanf("%d",&x);
		for(j=1;j<=x;j++) scanf("%d",&y),g[y]++;
		dfs1(1,0,i);
	}
	make1(1,0);make2(1,1);Tree::build();
	while(q--){
		scanf("%d",&x);vector<int> c1(x);for(i=0;i<x;i++) scanf("%d",&c1[i]);
		int Ls=c1.front();for(int i:c1) Ls=LCA(Ls,i);
		scs.clear();for(int i:c1) merge(Ls,i);
		scanf("%d",&x);int La=0;
		while(x--){
			int y;scanf("%d",&y);
			if(!La){La=y;continue;}
			for(int i:scs) Tree::merge(i,La,y); 
		}
	}
	Tree::push();
	for(i=2;i<=n;i++) for(j=1;j<=m;j++) if(GF(j,f[i])^j){
		// cerr<<j<<' '<<i<<' '<<GF(j,f[i])<<'\n';
		s.add(id[j][i],f[i][j]),s.add(id[f[i][j]][i],j);
	}
	for(i=1;i<=m;i++) for(j=2;j<=n;j++) if(~ans[i][j]) tarjan(i,j,ans[i][j]);
	for(i=1;i<=m;i++) for(j=2;j<=n;j++) if(ans[i][j]==-1) tarjan(i,j,1);
	for(i=1;i<=m;i++) {
		for(j=1;j<=n;j++) {
			int flag=0;for(int h:S[j]) flag|=ans[i][d[h]<d[j]?j:h]^(h!=fa[j]);
			if(!flag) printf("%d ",j);
			// cerr<<i<<' '<<j<<' '<<ans[i][j]<<' '<<flag<<'\n';
		}
	}
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}