#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mp(x,y) make_pair(x,y)
#define lb(x) (x&(-x))
#define fi first
#define se second
#define pii pair<int,int>
int read(){
	int x=0,f=1;
    char ch=getchar();
	while(ch<'0'||ch>'9'){
    	if(ch=='-')f=-1;
		ch=getchar();
    }
	while(ch>='0'&&ch<='9'){
    	x=x*10+ch-48;
		ch=getchar();
    }
	return x*f;
}
void writ(int x){
    if(x<0){
		putchar('-'),x=-x;
	}
    if(x>9){
		writ(x/10);
	}
    putchar(x%10 +'0');
}
void write(int x,char p=' '){
    writ(x);
    putchar(p);
}
string sread(){
    string t="";
    char c=getchar();
    while(c==' '||c=='\t'||c=='\r'||c=='\n'||c==0||c==EOF){
        c=getchar();
    }
    while(!(c==' '||c=='\t'||c=='\r'||c=='\n'||c==0||c==EOF)){
        t+=c,c=getchar();
    }
    return t;
}
const int QMR=1000000007,LSJ=998244353,inf=2e18,N=305,M=5e4+5,K=2e5+5;
//int cal(int a,int b=QMR-2){
//	int base=a,ret=1;
//	while(b){
//		if(b&1){
//			ret=ret*base%QMR;
//		}
//		base=base*base%QMR;
//		b>>=1;
//	}
//	return ret;
//}
mt19937 rnd(time(0)^clock());
namespace qwq{
	int head[K],tot=1,s,t,ans,anscost,d[K],cur[K],v[K];
	struct edges{
		int to,nxt,flow,cost;
	}edge[K*2];
	void add(int from,int to,int f,int c){
		++tot;
		edge[tot].to=to;
		edge[tot].flow=f;
		edge[tot].nxt=head[from];
		edge[tot].cost=c;
		head[from]=tot;
		++tot;
		edge[tot].to=from;
		edge[tot].flow=0;
		edge[tot].nxt=head[to];
		edge[tot].cost=-c;
		head[to]=tot;
	}
	bool spfa(int st){
		memset(v,0,sizeof(v));
		queue<int>q;
		for(int i=0;i<=t;i++){
			d[i]=inf;
		}
		d[st]=0;
		v[st]=1;
		q.push(st);
		int flag=0;
		while(q.size()){
			int x=q.front();
			q.pop();
			v[x]=0;
			for(int i=head[x];i;i=edge[i].nxt){
				int y=edge[i].to,z=edge[i].cost,zyh=edge[i].flow;
				if(d[y]>d[x]+z&&zyh){
					d[y]=d[x]+z;
					if(y==t){
						flag=1;
					}
					if(!v[y]){
						q.push(y);
						v[y]=1;
					}
				}
			}
		}
		return flag;
	}
	int dfs(int x,int flow){
		if(x==t){
			return flow;
		}
		v[x]=1;
		int rst=flow;
		for(int i=cur[x];i&&rst;i=edge[i].nxt){
			cur[x]=i;
			int y=edge[i].to,z=edge[i].flow,w=edge[i].cost;
			if(v[y]==0&&z>0&&d[y]==d[x]+w){
				int k=dfs(y,min(rst,z));
				rst-=k;
				edge[i].flow-=k;
				edge[i^1].flow+=k;
				anscost+=w*k;
			}
		}
		v[x]=0;
		return flow-rst;
	}
	void dinic(){
		while(spfa(s)){
			memcpy(cur,head,sizeof(head));
			ans+=dfs(s,inf);
		}
	}
}
int fa[N<<1];
struct node{
	int x,y,z;
}a[M];
bool cmp(node aa,node b){
	return aa.z<b.z;
}
int get(int x){
	if(x==fa[x])return x;
	return fa[x]=get(fa[x]);
}
basic_string<pii >g[N];
int n,m,k;
using qwq::add;
signed main(){
    //freopen("qmr.in","r",stdin);
    //freopen("qmr.out","w",stdout);
    n=read();m=read();k=read();qwq::s=2*n+k+1;qwq::t=qwq::s+1;
	for(int i=1;i<n*2;i++){
		fa[i]=i;
	} 
	for(int i=1;i<=m;i++){
		a[i].x=read();
		a[i].y=read();
		a[i].z=read();
	}
	for(int i=1;i<=k;i++){
		add(qwq::s,i,1,0);
	}
	for(int i=1;i<=k;i++){
		int qmr=read();
		while(qmr--){
			int x=read();
			add(i,x+k,1,0);
		}
	}
	sort(a+1,a+m+1,cmp);
	int cnt=0,sum=0;
	for(int i=1;i<=m;i++){
		int x=get(a[i].x),y=get(a[i].y);
		if(x!=y){
			++cnt;
			sum+=a[i].z;
			fa[x]=n+cnt;
			fa[y]=n+cnt;
			add(x+k,cnt+n+k,1,0);
			add(y+k,cnt+n+k,1,0);
			add(cnt+n+k,qwq::t,1,-a[i].z);
		}
	}
	int t=inf/31415926,tt=0;
	for(int i=1;i<2*n;i++){
		if(fa[i]==i){
			add(i+k,qwq::t,1,-t);tt+=t;
		}
	} 
	qwq::dinic();
	qwq::anscost+=tt;
	if(qwq::anscost>0){
		puts("-1");
	}
	else write(sum+qwq::anscost);
	return 0;
}