#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

mt19937 rng;

struct Graph
{
	int szL, szR;
	vector<VI> g;
	VI mateForR, mateForL, usedL;
	
	void init(int L, int R)
	{
		szL = L, szR = R;
		g.resize(szL);
		mateForL.resize(szL);
		usedL.resize(szL);
		
		mateForR.resize(szR);
	}
	
	void addEdge(int from, int to)
	{
		assert(0 <= from && from < szL);
		assert(0 <= to && to < szR);
		
		g[from].PB(to);
	}
	
	int iter;
	bool kuhn(int v)
	{
		if (usedL[v] == iter) return false;
		usedL[v] = iter;
		shuffle(ALL(g[v]), rng);
		for (int to : g[v])
		{
			if (mateForR[to] == -1)
			{
				mateForR[to] = v;
				mateForL[v] = to;
				return true;
			}
		}
		for (int to : g[v])
		{
			if (kuhn(mateForR[to]))
			{
				mateForR[to] = v;
				mateForL[v] = to;
				return true;
			}
		}
		return false;
	}
	int doKuhn()
	{
		fill(ALL(mateForR), -1);
		fill(ALL(mateForL), -1);
		fill(ALL(usedL), -1);
		
		int res = 0;
		iter = 0;
		
		while (true)
		{
			iter++;
			bool ok = false;
			FOR (v, 0, szL)
			{
				if (mateForL[v] == -1)
				{
					if (kuhn(v))
					{
						ok = true;
						res++;
					}
				}
			}
			if (!ok) break;
		}
		return res;
	}
};


struct DSU
{
	int n;
	VI p, sz;
	
	void init(int _n)
	{
		n = _n;
		p.resize(n);
		iota(ALL(p), 0);
		sz.assign(n, 1);
	}
	
	int find(int v)
	{
		if (v == p[v])
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if (u == v)
			return false;
		if (sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
};

int n, r, g;
bool check(vector<pair<int, PII>>& e, vector<VI>& gg)
{
	DSU d;
	d.init(n);
	for (auto [c, p] : e)
		d.unite(p.F, p.S);
	map<int, int> m;
	FOR (i, 0, n)
	{
		int c = d.find(i);
		if (!m.count(c))
			m[c] = SZ(m);
	}
	Graph G;
	G.init(SZ(m), g);
	FOR (i, 0, g)
	{
		for (auto v : gg[i])
			G.addEdge(m[d.find(v)], i);
	}
	int res = G.doKuhn();
	return res == SZ(m);
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> r >> g;
	vector<pair<int, PII>> edges;
	FOR (i, 0, r)
	{
		int a, b, c;
		cin >> a >> b >> c;
		a--, b--;
		edges.PB({c, {a, b}});
	}
	vector<VI> gg(g);
	FOR (i, 0, g)
	{
		int k;
		cin >> k;
		FOR (j, 0, k)
		{
			int v;
			cin >> v;
			gg[i].PB(v - 1);
		}
	}
	sort(ALL(edges));
	vector<pair<int, PII>> e;
	int cost = 0;
	DSU d;
	d.init(n);
	for (auto [c, p] : edges)
	{
		auto [u, v] = p;
		if (d.unite(u, v))
		{
			e.PB({c, p});
			cost += c;
		}
	}
	if (!check(e, gg))
	{
		cout << -1 << '\n';
		return 0;
	}
	int sz = SZ(e);
	RFOR (i, sz, 0)
	{
		vector<pair<int, PII>> ne;
		FOR (j, 0, SZ(e))
		{
			if (i != j)
				ne.PB(e[j]);
		}
		if (check(ne, gg))
		{
			cost -= e[i].F;
			e = ne;
		}
	}
	cout << cost << '\n';
	
	return 0;
}