#include<bits/stdc++.h>
using namespace std;
const int maxn=500010;

bool vis[maxn];
int n,m,s=100001,t=100002,x,y,z,f,dis[maxn],pre[maxn],last[maxn],flow[maxn],maxflow,mincost;
//dis最小花费;pre每个点的前驱；last每个点的所连的前一条边；flow源点到此处的流量 
struct Edge{
	int to,next,flow,dis;//flow流量 dis花费 
}edge[maxn];
int head[maxn],num_edge; 
queue <int> q;
void add_edge(int from,int to,int flow,int dis)
{
	edge[++num_edge].next=head[from];
	edge[num_edge].to=to;
	edge[num_edge].flow=flow;
	edge[num_edge].dis=dis;
	head[from]=num_edge;
}
inline void add(int u,int v,int w,int c)
{
	add_edge(u,v,w,c),add_edge(v,u,0,-c);
}
bool spfa(int s,int t)
{
	memset(dis,0x7f,sizeof(dis));
	memset(flow,0x7f,sizeof(flow));
	memset(vis,0,sizeof(vis));
	q.push(s); vis[s]=1; dis[s]=0; pre[t]=-1;
	
	while (!q.empty())
	{
		int now=q.front();
		q.pop();
		vis[now]=0;
		for (int i=head[now]; i!=-1; i=edge[i].next)
		{
			if (edge[i].flow>0 && dis[edge[i].to]>dis[now]+edge[i].dis)//正边 
			{
				dis[edge[i].to]=dis[now]+edge[i].dis;
				pre[edge[i].to]=now;
				last[edge[i].to]=i;
				flow[edge[i].to]=min(flow[now],edge[i].flow);//
				if (!vis[edge[i].to])
				{
					vis[edge[i].to]=1;
					q.push(edge[i].to);
				}
			}
		}
	}
	return pre[t]!=-1;
}

void MCMF()
{
	while (spfa(s,t))
	{
		int now=t;
		maxflow+=flow[t];
		mincost+=flow[t]*dis[t];
		while (now!=s)
		{//从源点一直回溯到汇点 
			edge[last[now]].flow-=flow[t];//flow和dis容易搞混 
			edge[last[now]^1].flow+=flow[t];
			now=pre[now];
		}
	}
}
int U[100005],V[100005],W[100005];
int main()
{
	memset(head,-1,sizeof(head)); num_edge=-1;
	int n,r,g;
	cin >> n >> r >> g;
	for(int i=1;i<=n;i++)
		add(s,i,1,0);
	int now=n;
	for(int i=1;i<=r;i++)
		cin >> U[i] >> V[i] >> W[i];
	for(int i=1;i<=g;i++)
	{
		int k;
		cin >> k;
		++now;
		add(now,t,1,-10000000);
		for(int j=1;j<=k;j++)
		{
			int x;
			cin >> x;
			add(x,now,1,0);
		}
	}
	for(int i=1;i<=r;i++)
	{
		int u=U[i],v=V[i],w=W[i];
		++now;
		add(now,t,1,w);
		add(u,now,1,0);
		add(v,now,1,0);
	}
	MCMF();
	mincost+=10000000*g;
	if(maxflow!=n||mincost>1e6)
	{
		cout << -1;
		return 0;
	}
	printf("%d",mincost);
	return 0;
}