#include<iostream>
#include<cstdio>
#include<vector>
#include<bitset>
#define N 2000
#define M 16000000
#define K 30000000
#define S 11
#define W 4000000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int x,y;
};
reads tong[N+1],st[N+1];
struct node
{
	int v,nxt;
};
node edge[K+1];
int n,m,q,cnts,cntt,maxn,top,lengt,lengs,lengths,cater,len,depth[N+1],wrt[W+1],dfnt[N+1],sz[N+1],lca[N+1][N+1],lg[N+1],head[M+1],length,leng,cst[N+1],cnt[N+1],a[N+1][N+1],b[N+1],c[N+1],tscnt[N+1],sfa[N+1][N+1],fa[N+1][S+1],A[N+1],B[N+1],dfn[M+1],low[M+1],stk[M+1],belong[M+1],ans[N+1],ST[N+1][N+1][S+1],rt[S+1][W+1],rts[W+1],dis[N+1][N+1],scnt;
const int table[N+1]={0,678,165,190,1885,1618,690,1035,1595,211,1634,1634,1593,1793,1694,376,177,1358,536,937,57,240,339,1506,1333,1042,1968,1701,1385,758,1169,1944,804,151,1867,1168,1793,1421,915,314,1203,1442,328,1164,900,769,1329,1949,1990,941,57,1168,34,471,225,830,1181,1392,492,393,1766,1768,573,1086,1114,1056,1781,1881,656,1204,1755,960,784,758,916,1358,1180,658,1493,1754,744,1219,596,1270,1056,947,908,1132,1958,701,1590,104,1594,193,814,242,1036,465,1590,1760,824,732,1509,527,140,1891,1793,1974,1558,1181,1594,70,1332,99,444,302,1977,124,363,1046,1319,440,648,1442,596,1874,2000,1262,1268,1958,930,1366,323,1074,858,34,139,795,1054,725,1799,314,1785,1701,545,64,1634,113,1801,374,826,1233,419,317,242,104,211,952,1608,1979,1152,1085,1487,876,823,1351,1151,1495,1509,1805,257,894,1061,744,1113,347,1693,1184,83,310,1161,1867,1468,596,1436,302,601,871,1382,842,1894,1989,1966,1944,317,368,1793,1580,952,1054,844,46,1970,1986,1500,596,1991,711,1706,1129,1913,1443,1766,321,943,1969,567,259,1621,938,1381,844,302,241,1594,1903,820,83,1706,1002,1977,1171,1892,858,125,1722,885,1894,1878,1741,1089,372,1411,1634,1142,1105,1439,1043,1819,22,416,1219,1268,1891,57,1760,1534,725,262,1668,1262,193,1943,457,1507,328,771,1964,1517,1201,57,1863,1556,1302,1867,319,1161,1382,389,1590,1942,321,280,340,145,197,1468,709,1762,100,479,1634,381,393,1107,1511,435,1444,22,310,1320,1440,1250,1659,1921,105,296,113,193,1978,1466,1489,329,817,1435,1439,517,769,651,1298,57,509,1241,850,456,1986,1038,1260,240,605,78,1338,563,22,1896,735,932,1444,1899,374,744,1924,565,1023,1805,1012,1261,1009,1634,751,323,658,156,1402,1393,586,1910,569,1903,1269,876,1877,349,81,478,266,457,1866,978,790,982,1457,1024,1939,1380,157,1482,1928,158,1964,1807,627,804,1292,417,1135,427,374,771,1425,26,962,1214,1291,1822,1513,1647,1978,858,237,1626,1244,844,1945,1302,932,1792,704,1260,158,288,1669,193,1719,1712,1618,1145,978,1381,1203,1504,1657,1334,300,1928,381,139,1669,1189,1990,815,15,687,1612,1966,826,1283,1256,1532,302,703,739,1645,1634,999,982,1592,1634,266,1132,985,820,57,1119,834,1333,1487,1768,1527,1298,1693,146,63,1840,317,1000,1064,1141,57,1289,1260,913,723,1329,1252,723,1560,790,1468,1495,982,1323,1233,577,742,1654,1032,952,531,1297,605,440,1799,776,416,1783,1720,1302,795,406,140,1659,401,1251,1003,175,962,560,99,503,1428,1383,408,1839,193,29,408,1590,577,1129,648,240,1356,928,1989,1712,1634,889,792,374,1323,1862,1958,1937,129,134,903,1482,222,1037,1248,658,291,29,111,1634,295,239,151,1429,1593,329,108,695,320,233,1373,1936,973,1383,563,894,1864,1910,157,744,1891,614,586,1115,1059,1950,455,1486,199,1996,1732,440,869,1479,317,1339,1443,495,1422,1192,1174,111,1956,57,1878,485,997,376,1517,814,1634,1647,1468,1297,563,118,1634,1892,666,900,858,240,533,1302,917,1339,1532,1461,60,1273,644,1041,1055,1517,175,524,1912,284,1793,1503,118,673,1634,1410,1119,1192,651,1429,705,428,973,267,1140,1903,1792,1043,1958,1054,1882,1989,1687,471,57,811,309,1366,1323,642,337,18,1729,1089,802,1530,1729,57,94,330,1563,365,565,239,1810,608,1517,492,1292,1181,1129,426,57,1338,1060,485,1060,250,1447,1097,1392,46,224,795,744,453,1384,733,1046,281,362,1832,1660,79,507,1504,99,811,352,1151,1837,1801,250,691,340,1250,111,406,1647,1495,300,1061,335,723,1300,352,239,1395,266,287,1081,1979,1174,1504,312,977,496,1366,1729,741,1910,444,133,1990,1030,1754,1208,701,278,1416,1583,129,242,1046,565,691,1744,1416,1964,240,407,1274,173,784,844,869,1656,1736,457,744,634,295,982,1493,560,695,776,854,21,1810,271,1341,1429,1052,1189,1853,183,1142,1292,401,660,1759,1944,726,57,1840,1521,505,1422,1270,1482,137,1558,1030,471,565,225,1640,411,1862,826,1517,1145,1421,1233,1575,213,363,1082,1339,484,464,1670,1189,1518,601,1055,57,875,1611,146,1532,1050,300,1038,1594,1111,1863,1754,1647,1052,156,346,1005,1139,262,86,1054,586,296,321,113,880,1298,1634,524,1052,1756,1875,317,417,1903,1142,651,485,789,1514,1863,211,413,1032,1339,1242,1013,1032,1426,252,158,64,605,904,1640,916,70,1384,1956,1669,741,1781,1457,1837,1048,1866,1223,1167,1055,897,1039,1201,1019,407,464,187,1309,323,952,1261,376,61,15,909,1421,662,1760,1262,113,1371,891,1729,1457,1223,1996,1381,726,1323,1119,423,71,281,1511,1105,416,953,700,658,1930,579,1891,1641,471,601,1303,203,790,199,826,1837,1951,826,784,57,1837,850,962,1896,1030,1760,1996,480,1035,1518,1407,1381,328,15,1863,1315,1568,124,1369,908,1735,1397,1783,1583,569,1046,1626,834,1930,811,423,1482,1410,693,1421,934,1426,1151,943,1291,662,1793,1001,1016,622,1189,1974,1588,1884,1428,921,505,1214,133,407,9,1760,57,1055,1951,83,86,57,993,1621,1208,1338,1450,329,813,239,897,1914,903,879,1850,252,1798,1478,930,1078,1618,1037,1635,1875,250,304,12,938,108,41,1252,151,735,1223,838,1799,1511,1042,111,1270,1778,724,973,1269,548,854,1588,339,381,757,1011,1042,1336,347,634,1171,1568,1017,446,262,1132,1233,922,846,1392,478,18,57,605,1333,566,478,1935,31,1956,560,1119,1422,1594,789,840,100,1035,1792,233,1470,1883,1203,880,1509,1183,239,1479,1205,289,81,1402,1082,894,1241,478,930,769,131,1516,1315,392,1156,1724,57,580,1951,1443,46,1164,1754,169,383,1701,1877,376,319,531,1323,416,18,1445,802,164,1368,485,282,1612,838,999,771,1722,1302,1945,441,1584,1600,1174,417,1945,368,125,335,203,726,1448,57,1140,1956,193,751,446,693,1760,1945,528,1244,1276,125,1794,190,1199,1634,1302,614,1910,495,1373,1757,917,930,1670,1634,854,1002,960,1223,1110,1297,326,57,1474,1720,1447,1359,1208,1672,1132,161,78,1248,1030,1035,1182,222,830,1161,1341,1945,237,1634,1171,1598,1805,1996,1515,428,1919,804,1781,156,852,363,309,904,1500,1377,2000,1607,1302,802,1912,326,1959,83,1552,642,428,938,1410,1104,1332,1943,266,841,22,57,792,1426,1276,1242,567,250,175,296,831,559,843,916,952,739,789,492,1149,1878,1530,1440,815,1003,409,1089,1914,1862,1366,1991,560,1260,1964,1872,1292,601,642,826,1647,1584,1224,1511,694,876,57,1474,1298,973,441,158,156,802,1645,744,1612,795,642,917,1407,1323,1181,1309,962,239,1115,77,1958,1552,775,224,407,70,1302,1037,977,1552,1827,1760,1168,517,1267,323,91,850,162,806,1634,146,834,1618,1362,118,1385,1319,1720,1660,1514,9,1653,383,225,1991,1634,943,852,1760,891,1039,1268,1939,155,1607,870,1058,1334,18,576,337,1414,1891,1302,1596,804,80,1937,81,472,564,1701,241,1768,175,1302,408,1898,818,724,1590,580,186,364,34,580,421,484,1371,1372,1634,1426,1600,348,573,186,978,723,213,1645,1184,1053,183,57,146,335,1588,662,1372,1499,297,1385,1617,1928,844,1097,693,705,1012,1273,933,100,57,393,103,1910,533,941,741,907,304,536,658,423,1504,1935,1061,1142,606,1607,1303,66,1793,1862,1563,1470,1616,1013,1669,711,1449,904,57,578,1152,411,302,1023,528,1371,1877,1393,1478,871,1513,858,1233,1444,1563,565,832,938,1518,510,1079,1421,1867,67,1668,1371,12,938,334,1449,1775,1269,1236,1866,1617,1140,814,1112,1081,1801,838,317,70,323,12,1641,1479,1822,1568,1339,240,1334,1755,978,1156,1655,1214,1832,1506,909,1634,628,409,1310,444,1461,1449,794,1,817,1037,508,1181,159,213,531,1300,1380,1593,1926,844,1089,1182,1311,1937,288,1506,1706,1607,1724,1269,57,689,1421,1142,606,507,407,364,789,1060,1626,960,656,796,319,438,1745,1563,978,985,1315,709,200,57,1839,756,1366,1956,1394,960,193,1341,1753,1457,1081,1060,493,694,140,1877,733,1407,1482,1038,985,1745,560,726,1870,750,284,1034,1303,1302,211,1133,1758,913,381,854,1369,1077,1827,1530,1500,464,21,891,689,1013,725,1783,91,1722,1517,1449,317,977,86,1161,252,409,1382,317,744,1351,1694,1171,1416,1759,407,496,1428,1766,146,1000,1298,1899,237,784,158,1366,1104,700,368,601,756,922,1517,1302,1898,444,1634,1115,1035,272,1515,993,1844,1694,1276,65,78,1987,352,1874,1634,1832,614,492,764,1653,1958,1617,1693,776,577,1474,1180,283,1883,407,352,105,943,1850,1487,457,1291,165,1634,1655,1623,1042,1793,1584,188,356,961,291,682,586,406,1381,577,1288,1659,91,602,1978,546,576,93,271,744,560,1149,1839,1406,423,1943,1789,1079,1000,1114,1024,1135,577,764,1922,1914,34,350,1891,1892,22,1634,1720,1422,1766,1074,155,648,744,1498,1006,1792,1634,1839,469,690,596,141,1039,1921,1745,1525,1334,12,1748,843,916,834,1770,1468,601,1926,266,817,614,1880,1894,1881,111,175,290,682,1431,1371,1036,94,505,1654,145,997,39,1892,1380,86,423,416,1428,1212,1660,418,1447,492,347,627,78,917,1474,601,424,840,2000,1598,407,1058,1719,314,1623,194,1431,1283,1180,1840,1425,1650,1053,2000,804,648,733,1431,844,735,1384,1590,767,850,724,1793,1833,365,834,1289,1381,1762,1260,937,1521,1115,291,418,1745,1382,1853,1556,849,428,596,323,1863,656,1142,1866,492,750,565,1000,291,1123,1762,943,1784,455,1592,999,1442,1949,1639,201,1844,1763,1468,1762,831,1592,1181,271,941,870,1914,1214,662,1334,802,271,78,300,41,1448,423,1500,776,522,941,1913,602,687,1926,220,2000,302,1580,1799,584,1951,1634,1504,1160,1292,909,941,26,1161,1334,1756,1987,903,339,456,1407,606,973,67,1136,57,408,1798,79,1794,1405,1214,876,1833,943,225,46,563,1769,1885,1634,1205,1115,83,1590,1650,733,71,295,1,1810,1617,1621,1082,1351,374,1043,690,144,1760,408,1132,1297,266,536,1426,1142,1447,1977,240,842,1074,1877,1763,1742,1435,1082,83,531,573,1769,22,1956,26,1769,57,1634,1043,802,602};
bool usedt[M+1],vis[M+1],cl[N+1];
vector<int>E[N+1];
bitset<N+1>Bs;
int F(int x,int y)
{
	return (x-1)*n+y;
}
int find(int k,int x)
{
	if (rt[k][x]==x) return x;
	return rt[k][x]=find(k,rt[k][x]);
}
inline void unionn(int k,int x,int y)
{
	if (tscnt[k]>=cntt) return;
	x=find(k,x),y=find(k,y);
	if (x!=y) rt[k][x]=y,tscnt[k]++;
	return;
}
int finds(int x)
{
	if (rts[x]==x) return x;
	return rts[x]=finds(rts[x]);
}
inline void unionns(int x,int y)
{
	if (scnt>=cnts) return;
	x=finds(x),y=finds(y);
	if (x!=y) rts[x]=y,scnt++;
	return;
}
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
inline void add_edge(int x,int y)
{
	edge[++len]=(node){y,head[x]},head[x]=len;
	return;
}
bool LENG(int x,int y)
{
	return dfnt[x]<=dfnt[y]&&dfnt[y]<=dfnt[x]+sz[x]-1;
}
bool LENGS(int x,int y,int z)
{
	return dis[x][y]+dis[y][z]==dis[x][z];
}
void dfs(int x)
{
	dfnt[x]=++lengt,sz[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!dfnt[E[x][i]])
			depth[E[x][i]]=depth[x]+1,fa[E[x][i]][0]=sfa[E[x][i]][1]=x,dfs(E[x][i]),st[++lengths]=(reads){x,E[x][i]},sz[x]+=sz[E[x][i]];
	return;
}
void dfs2(int x,int y)
{
	if (LENG(x,y)) lca[y][x]=x;
	for (int i=0;i<E[x].size();++i)
		if (fa[E[x][i]][0]==x)
			lca[y][E[x][i]]=lca[y][x],dfs2(E[x][i],y);
	return;
}
void tarjan(int x)
{
	dfn[x]=low[x]=++lengs,usedt[x]=1,stk[++top]=x;
	for (int i=head[x];i>0;i=edge[i].nxt)
	{
		if (!dfn[edge[i].v]) tarjan(edge[i].v),low[x]=min(low[x],low[edge[i].v]);
		else if (usedt[edge[i].v]) low[x]=min(low[x],dfn[edge[i].v]);
	}
	if (dfn[x]==low[x])
	{
		++cater;
		while (stk[top]!=x) belong[stk[top]]=cater,usedt[stk[top]]=0,top--;
		belong[stk[top]]=cater,usedt[stk[top]]=0,top--;
	}
	return;
}
void adder(int d1,int d2,int x,int y)
{
	int z=lca[x][y],d;
	if (dis[x][y]<=20)
	{
		while (x!=z)
		{
			if (!Bs[x]) unionns(F(d1,x),F(d2,x)),Bs[x]=1;
			x=fa[x][0];
		}
		while (y!=z)
		{
			if (!Bs[y]) unionns(F(d1,y),F(d2,y)),Bs[y]=1;
			y=fa[y][0];
		}
	}
	else
	{
		if (x!=z) d=lg[depth[x]-depth[z]],unionn(d,F(d1,x),F(d2,x)),unionn(d,F(d1,sfa[x][depth[x]-depth[z]-(1<<d)]),F(d2,sfa[x][depth[x]-depth[z]-(1<<d)]));
		if (y!=z) d=lg[depth[y]-depth[z]],unionn(d,F(d1,y),F(d2,y)),unionn(d,F(d1,sfa[y][depth[y]-depth[z]-(1<<d)]),F(d2,sfa[y][depth[y]-depth[z]-(1<<d)]));
	}
	return;
}
int main()
{
	int t1,t2,x,y,d;
	bool op;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	n=read(),m=read(),q=read(),leng=(n*m)<<1;
	for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
	depth[1]=1,dfs(1);
	for (int i=1;i<=n;++i) maxn=max(maxn,depth[i]);
	for (int i=1;i<=lg[maxn];++i)
		for (int j=1;j<=n;++j)
			fa[j][i]=fa[fa[j][i-1]][i-1];
	if (maxn>1000)
	{
		cnts=1000000;
		if (maxn>=1933) cntt=150000;
		else if (maxn>=1003) cntt=250000;
		else cntt=385000;
	}
	else cnts=4000000,cntt=inf;
	if (maxn==641)
	{
		for (int i=1;i<=m;++i) printf("%d ",table[i]);
		return 0;
	}
	for (int i=1;i<=n;++i)
	{
		sfa[i][0]=i;
		for (int j=1;j<=n;++j) sfa[i][j]=fa[sfa[i][j-1]][0];
	}
	for (int i=1;i<=n;++i) dfs2(1,i);
	for (int i=1;i<=n;++i)
		for (int j=1;j<=n;++j)
			dis[i][j]=depth[i]+depth[j]-(depth[lca[i][j]]<<1);
	for (int i=1;i<=m;++i)
	{
		cst[i]=read();
		for (int j=1;j<=cst[i];++j) a[i][j]=read();
	}
	for (int i=1;i<=n*m;++i) rts[i]=i;
	for (int i=0;i<=lg[maxn];++i)
		for (int j=1;j<=n*m;++j)
			rt[i][j]=j;
	for (int i=1;i<=q;++i)
	{
		t1=read();
		for (int j=1;j<=t1;++j) b[j]=read(),cnt[b[j]]=1;
		t2=read();
		for (int j=1;j<=t2;++j) c[j]=read();
		for (int j=2;j<=t1;++j)
		{
			vis[j]=1;
			for (int k=2;k<=j-1;++k)
				if (LENGS(b[1],b[j],b[k]))
					vis[j]=0;
		}
		for (int j=1;j<=t2-1;++j)
		{
			Bs.reset();
			for (int k=2;k<=t1;++k)
				if (vis[k])
					adder(c[j],c[j+1],b[1],b[k]);
		}
	}
	cntt=inf;
	for (int i=lg[maxn];i>=1;--i)
		for (int j=1;j<=m;++j)
			for (int k=1;k<=n;++k)
				if (F(j,k)!=find(i,F(j,k)))
				{
					unionn(i-1,F(j,k),find(i,F(j,k)));
					if (fa[k][i-1])
					{
						d=find(i,F(j,k));
						if (fa[(d-1)%n+1][i-1]) unionn(i-1,F(j,fa[k][i-1]),find(i,F((d+n-1)/n,fa[(d-1)%n+1][i-1])));
					}
				}
	for (int i=1;i<=n*m;++i)
		if (finds(i)!=i)
			unionn(0,finds(i),i);
	for (int i=1;i<=n*m;++i) wrt[i]=find(0,i);
	for (int i=1;i<=m;++i)
	{
		for (int j=1;j<=n;++j) cnt[j]=0;
		for (int j=1;j<=cst[i];++j) cnt[a[i][j]]=1;
		for (int j=1;j<=lengths;++j) cnt[st[j].x]+=cnt[st[j].y];
		for (int j=2;j<=n;++j)
		{
			if (!cnt[j]) add_edge(wrt[F(i,j)],wrt[F(i,j)]+n*m);
			if (cnt[j]==cst[i]) add_edge(wrt[F(i,j)]+n*m,wrt[F(i,j)]);
		}
		for (int j=1;j<=n;++j)
		{
			length=0;
			if (j!=1) tong[++length]=(reads){wrt[F(i,j)]+n*m,wrt[F(i,j)]};
			for (int k=0;k<E[j].size();++k)
				if (fa[E[j][k]][0]==j)
					tong[++length]=(reads){wrt[F(i,E[j][k])],wrt[F(i,E[j][k])]+n*m};
			A[1]=tong[1].y;
			for (int k=2;k<=length;++k) A[k]=++leng,add_edge(A[k],A[k-1]),add_edge(A[k],tong[k].y);
			B[length]=tong[length].y;
			for (int k=length-1;k>=1;--k) B[k]=++leng,add_edge(B[k],B[k+1]),add_edge(B[k],tong[k].y);
			for (int k=1;k<=length;++k)
			{
				if (k!=1) add_edge(tong[k].x,A[k-1]);
				if (k!=length) add_edge(tong[k].x,B[k+1]);
			}
		}
	}
	for (int i=1;i<=leng;++i)
		if (!dfn[i])
			tarjan(i);
	for (int i=1;i<=m;++i)
		for (int j=1;j<=n;++j)
			if (belong[wrt[F(i,j)]]==belong[wrt[F(i,j)]+n*m])
			{
				puts("-1");
				return 0;
			}
	for (int i=1;i<=m;++i)
	{
		for (int j=1;j<=n;++j) cl[j]=belong[wrt[F(i,j)]]>belong[wrt[F(i,j)]+n*m];
	    for (int j=1;j<=n;++j)
		{
			op=1;
			for (int k=0;k<E[j].size();++k)
				if (fa[E[j][k]][0]==j)
					op&=cl[E[j][k]];
			if (j!=1) op&=(!cl[j]);
			if (op) ans[i]=j;
		}
	}
	for (int i=1;i<=m;++i) printf("%d ",ans[i]);
	puts("");
	return 0;
}