#include<bits/stdc++.h>
namespace my_std{
	using namespace std;
	#define pii pair<int,int>
	#define fir first
	#define sec second
	#define MP make_pair
	#define rep(i,x,y) for (int i=(x);i<=(y);i++)
	#define drep(i,x,y) for (int i=(x);i>=(y);i--)
	#define go(x) for (int i=head[x];i;i=edge[i].nxt)
	#define templ template<typename T>
	typedef long long ll;
	typedef double db;
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	templ inline T rnd(T l,T r) {return uniform_int_distribution<T>(l,r)(rng);}
	templ inline bool chkmax(T &x,T y){return x<y?x=y,1:0;}
	templ inline bool chkmin(T &x,T y){return x>y?x=y,1:0;}
	templ inline void read(T& t)
	{
		t=0;char f=0,ch=getchar();double d=0.1;
		while(ch>'9'||ch<'0') f|=(ch=='-'),ch=getchar();
		while(ch<='9'&&ch>='0') t=t*10+ch-48,ch=getchar();
		if(ch=='.'){ch=getchar();while(ch<='9'&&ch>='0') t+=d*(ch^48),d*=0.1,ch=getchar();}
		t=(f?-t:t);
	}
	template<typename T,typename... Args>inline void read(T& t,Args&... args){read(t); read(args...);}
	char __sr[1<<21],__z[20];int __C=-1,__zz=0;
	inline void Ot(){fwrite(__sr,1,__C+1,stdout),__C=-1;}
	inline void print(int x)
	{
		if(__C>1<<20)Ot();if(x<0)__sr[++__C]='-',x=-x;
		while(__z[++__zz]=x%10+48,x/=10);
		while(__sr[++__C]=__z[__zz],--__zz);__sr[++__C]='\n';
	}
	void file()
	{
		#ifdef NTFOrz
		freopen("a.in","r",stdin);
		#endif
	}
	inline void chktime()
	{
		#ifdef NTFOrz
		cerr<<clock()/1000.0<<'\n';
		#endif
	}
	#ifdef mod
	ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x%mod) if (y&1) ret=ret*x%mod;return ret;}
	ll inv(ll x){return ksm(x,mod-2);}
	#else
	ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x) if (y&1) ret=ret*x;return ret;}
	#endif
//	inline ll mul(ll a,ll b){ll d=(ll)(a*(double)b/mod+0.5);ll ret=a*b-d*mod;if (ret<0) ret+=mod;return ret;}
}
using namespace my_std;

namespace Flow
{
	#define sz 505050
	int n,S,T;
	struct hh{int t,w,c,nxt;}edge[sz<<1];
	int head[sz],ecnt=1;
	void make_edge(int f,int t,int w,int c) 
	{
		c=-c;
		edge[++ecnt]=(hh){t,w,c,head[f]};
		head[f]=ecnt;
		edge[++ecnt]=(hh){f,0,-c,head[t]};
		head[t]=ecnt; 
	}
	
	int dis[sz],flow[sz];
	int pre[sz];
	bool in[sz];
	bool SPFA()
	{
		rep(i,1,n) dis[i]=1e9,flow[i]=0,pre[i]=0;
		queue<int>q;
		q.push(S);dis[S]=0;flow[S]=1e9;in[S]=1;
		#define v edge[i].t
		while (!q.empty())
		{
			int x=q.front();q.pop();in[x]=0;
			go(x) 
				if (edge[i].w&&chkmin(dis[v],dis[x]+edge[i].c))  
					flow[v]=min(flow[x],edge[i].w),pre[v]=i,(!in[v]&&(q.push(v),0)),in[v]=1;
		}
		#undef v
		return dis[T]!=1e9;
	}
	int mxflow,mncost;
	void update(){int f=flow[T];mxflow+=f;mncost+=dis[T]*f;for (int x=T,i;i=pre[x],x!=S;x=edge[i^1].t) edge[i].w-=f,edge[i^1].w+=f;}
	int work(){while (SPFA()) update();return -mncost;}
	#undef sz
}

namespace Build
{
	#define sz 333
	int n,m,K;
	int S,T;
	struct hh{int u,v,w;bool operator < (const hh &a) const {return w<a.w;}}e[sz*sz];
	int fa[sz];
	int getfa(int x){return x==fa[x]?x:fa[x]=getfa(fa[x]);}
	vector<int>V[sz];
	
	void dfs(int x,int f)
	{
		Flow::make_edge(x*2-1,x*2,1,0);
		for (auto ee:V[x])
		{
			int v=e[ee].u^e[ee].v^x; if (v==f) continue;
			Flow::make_edge(v*2,x*2-1,1,0);
			Flow::make_edge(v*2,T,1,e[ee].w);
			dfs(v,x);
		}
	}
	
	void work()
	{
		read(n,m,K);
		S=n*2+K+1,T=S+1;
		int x,y,z;
		rep(i,1,m) read(x,y,z),e[i]=(hh){x,y,z};
		sort(e+1,e+m+1);
		rep(i,1,n) fa[i]=i;
		ll ans=0;
		rep(i,1,m)
		{
			x=e[i].u,y=e[i].v;
			if (getfa(x)!=getfa(y)) V[x].push_back(i),V[y].push_back(i),fa[fa[x]]=fa[y],ans+=e[i].w;
		}
		const int MX=333333; int c=0;
		rep(i,1,n) if (i==fa[i]) dfs(i,0),Flow::make_edge(i*2,T,1,MX),++c;
		rep(i,1,K)
		{
			Flow::make_edge(S,n*2+i,1,0);
			int k; read(k);
			while (k--) read(x),Flow::make_edge(n*2+i,x*2-1,1,0);
		}
		Flow::n=Flow::T=T; Flow::S=S;
		ans-=Flow::work();
		ans+=c*MX;
		if (Flow::mxflow==K) cout<<ans<<'\n';
		else puts("-1");
	}
}

int main()
{
	file();
	Build::work();
	return 0;
}