#include<bits/stdc++.h>
using namespace std;
#define ll int
ll n,m,q;
ll cn=0;
struct sat{
	#define M 20000100
	ll fir[M],nxt[M],v[M],cnt=0;
	inline void Add(ll x,ll u){v[++cnt]=u;nxt[cnt]=fir[x];fir[x]=cnt;return ;}
	inline void add(ll x,ll y,ll u,ll v){
		x=2*x+y;u=2*u+v;Add(x,u);Add(u^1,x^1);
		return;
	}ll dfn[M],low[M],dfncnt=0;
	ll st[M],top=0,col[M];ll colcnt=0;
	bool ins[M];
	inline void tar(ll x){
		dfn[x]=low[x]=++dfncnt;st[++top]=x;ins[x]=1;
		for(int i=fir[x];i;i=nxt[i]){
			ll vi=v[i];if(dfn[vi]){if(ins[vi])low[x]=min(low[x],dfn[vi]);}
			else{
				tar(vi);low[x]=min(low[x],low[vi]);
			}
		}if(dfn[x]==low[x]){
			col[x]=++colcnt;ins[x]=0;while(st[top]!=x){
				col[st[top]]=colcnt;ins[st[top]]=0;top--;
			}top--;
		}return ;
	}
	inline void solve(){
		for(int i=2;i<=cn+cn+1;i++)if(!dfn[i])tar(i);
		return ;
	}
}o;
#define N 2010
vector<ll>e[N];
ll fa[N],dfn[N],xu[N],dfncnt=0;
ll top[N],siz[N],son[N],dep[N];
inline void dfs(ll x,ll faa){
	dep[x]=dep[faa]+1;siz[x]=1;fa[x]=faa;for(auto o:e[x]){
		if(o==faa)continue;dfs(o,x);siz[x]+=siz[o];
		if(siz[o]>siz[son[x]])son[x]=o;
	}return ;
}
inline void dfs1(ll x,ll tp){
	dfn[x]=++dfncnt;top[x]=tp;xu[dfncnt]=x;
	if(son[x]){
		dfs1(son[x],tp);
	}for(auto o:e[x]){
		if(dfn[o])continue;dfs1(o,o);
	}return ;
}
inline ll lca(ll x,ll y){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		x=fa[top[x]];
	}return (dep[x]<dep[y])?x:y;
}
ll vis[N][N];
struct dsu{
	ll fa[N];inline void init(){for(int i=1;i<=m;i++)fa[i]=i;return ;}
	inline ll getf(ll x){return (fa[x]==x)?x:fa[x]=getf(fa[x]);}
	inline bool merge(ll x,ll y){ll o=getf(x),p=getf(y);if(o==p)return false;fa[o]=p;return true;}
}g[N];
struct xg{ll pos,x,y;};
vector<xg>rc[N];
ll tem[N],tt[N];
ll bh[N][N]; 
ll nw[N];
int main(){
//	freopen("test1.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m>>q;for(int i=1;i<n;i++){
		ll u,v;cin>>u>>v;e[u].push_back(v);e[v].push_back(u);
	}for(int i=1;i<=n;i++)g[i].init();
	dfs(1,0);dfs1(1,1);
	for(int i=1;i<=m;i++){
		ll k;cin>>k;for(int j=1,x;j<=k;j++)cin>>x,vis[i][x]++;
		for(int j=n;j>=2;j--)vis[i][fa[xu[j]]]+=vis[i][xu[j]];
	}for(int i=1;i<=q;i++){
		ll k;cin>>k;for(int j=1;j<=k;j++)cin>>tem[j];tem[k+1]=tem[1];
		ll l;cin>>l;for(int j=1;j<=l;j++)cin>>tt[j];tt[l+1]=tt[1];
		for(int j=1;j<=k;j++){
			ll u=lca(tem[j],tem[j+1]);
			for(int p=1;p<=l;p++)rc[u].push_back((xg){tem[j],tt[p],tt[p+1]});
		}
	}for(int t=1;t<=n;t++){
		ll i=xu[t];for(auto o:rc[i]){
			ll nw=o.pos;
			while(nw!=i&&g[nw].merge(o.x,o.y))nw=fa[nw];
		}
	}for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(g[i].getf(j)==j)bh[j][i]=++cn;
		}for(int j=1;j<=n;j++)bh[j][i]=bh[g[i].getf(j)][i];
	}for(int i=1;i<=m;i++){
		memcpy(nw,bh[i],sizeof(nw));
		for(int t=n;t>=1;t--){
			ll j=xu[t],g=bh[i][j];if(!vis[i][j])o.add(g,1,g,0);
			else if(vis[i][j]==vis[i][1])o.add(g,0,g,1);
			else{
				ll f=nw[fa[j]];o.add(g,1,f,1);
				if(dfn[fa[j]]+1!=dfn[j]){
					++cn;o.add(g,1,cn,0);
					o.add(cn,1,f,1);nw[fa[j]]=cn;
				}
			}
		}
	}
	o.solve();//for(int i=2;i<=cn+cn+1;i++)cout<<o.col[i]<<'\n';
	for(int i=1;i<=m;i++){
		ll rc=0;for(int j=1;j<=n;j++){
			ll tem=bh[i][xu[j]];if(o.col[tem*2+1]<o.col[tem*2])rc=xu[j];
			if(o.col[tem*2+1]==o.col[tem*2]){
				cout<<-1;return 0;
			}	
		}cout<<rc<<' ';
	}return 0;
}