#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;
	}
};

const int N = 200'447;

VI g[N];

int used[N];
bool ok = 1;

int col[N];
void dfs(int v)
{
	used[v] = 1;
	for(int to : g[v])
	{
		if(used[to])
		{
			if(col[to] == col[v])
				ok = 0;
		}
		else
		{
			col[to] = col[v] ^ 1;
			dfs(to);
		}
	}
}



int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int a, c, t;
	cin >> a >> c >> t;
	
	FOR (i, 0, a)
	{
		int l;
		cin >> l;
		FOR (j, 0, l)
		{
			int x;
			cin >> x;
			g[i].PB(a + x - 1);
		}
	}
	FOR (i, 0, a)
	{
		int l;
		cin >> l;
		FOR (j, 0, l)
		{
			int x;
			cin >> x;
			g[i].PB(a + c + x - 1);
		}
	}
	
	FOR (i, 0, c)
	{
		int l;
		cin >> l;
		FOR (j, 0, l)
		{
			int x;
			cin >> x;
			g[a + i].PB(a + c + x - 1);
		}
	}
	
	map<PII, VI> m;
	
	int cnt = 0;
	
	FOR (i, 0, a)
	{
		set<int> susids;
		for (auto to : g[i])
			susids.insert(to);
		for (auto u : g[i])
		{
			for (auto v : g[u])
			{
				if (!susids.count(v))
					continue;
				m[{i, u}].PB(cnt);
				m[{i, v}].PB(cnt);
				m[{u, v}].PB(cnt);
				cnt++;
			}
		}
	}
	FOR(i, 0, a + c + t)
		g[i].clear();
	
	Graph G;
	G.init(cnt, cnt);
	for (auto [p, v] : m)
	{
		assert(SZ(v) <= 2);
		if (SZ(v) == 2)
		{
			G.addEdge(v[0], v[1]);
			G.addEdge(v[1], v[0]);
			
			g[v[0]].PB(v[1]);
			g[v[1]].PB(v[0]);
		}
	}
	int num = 0;
	FOR(i, 0, cnt)
	{
		if(used[i])
			continue;
		ok = 1;
		dfs(i);
		if(!ok)
			num++;
	}
	int ans = cnt - G.doKuhn() / 2;
	ans -= (num + 1) / 2;
	
	cout << ans << '\n';
	
	
	
	return 0;
}