#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const int inf = 0x3f3f3f3f;
int n,m1,m2,Ans[MAXN];
int idx,head[MAXN],dis[666][666];
struct node{
	int v,w,nxt;
}edge[MAXN];
inline void add(int u,int v,int w)
{
	edge[++ idx].v = v;
	edge[idx].w = w;
	edge[idx].nxt = head[u];
	head[u] = idx;
}

int dfn[MAXN],low[MAXN],col[MAXN],st[MAXN];
int sccnt,ind,top;
bool vis[MAXN];

void tarjan(int u)
{
	dfn[u] = low[u] = ++ ind;
	vis[u] = 1;
	st[++ top] = u;
	for(int i = head[u];i;i = edge[i].nxt)
	{
		int v = edge[i].v;
		if(!dfn[v])
		{
			tarjan(v);
			low[u] = min(low[u],low[v]);
		}
		else if(vis[v])
			low[u] = min(low[u],dfn[v]);
	}
	if(low[u] == dfn[u])
	{
		sccnt ++;
		while(st[top + 1] != u)
		{
			col[st[top]] = sccnt;
			vis[st[top --]] = 0;
		}
	}
}

signed main()
{
	scanf("%d %d %d",&n,&m1,&m2);
	memset(dis,inf,sizeof(dis));
	for(int i = 1;i <= m1;i ++)
	{
		int u,v;
		scanf("%d %d",&u,&v);
		add(v,u,-1),add(u,v,1);
		dis[v][u] = min(dis[v][u],-1),dis[u][v] = min(dis[u][v],1);
	}
	for(int i = 1;i <= m2;i ++)
	{
		int u,v;
		scanf("%d %d",&u,&v);
		add(v,u,0);
		dis[v][u] = min(dis[v][u],0);
	}
	for(int i = 1;i <= n;i ++)
	{
		dis[i][i] = 0;
		if(!dfn[i]) tarjan(i);
	}
	for(int k = 1;k <= n;k ++)
	{
		for(int i = 1;i <= n;i ++)
		{
			if(col[k] == col[i] && dis[i][k] != inf)
			{
				for(int j = 1;j <= n;j ++)
				{
					if(col[i] == col[j])
						dis[i][j] = min(dis[i][j],dis[k][j] + dis[i][k]);
				}
			}
		}
	}
	for(int i = 1;i <= n;i ++)
	{
		if(dis[i][i])
		{
			printf("NIE\n");
			return 0;
		}
	}
	int Answer = 0;
	for(int i = 1;i <= n;i ++)
	{
		for(int j = 1;j <= n;j ++)
		{
			if(col[i] == col[j])
				Ans[col[i]] = max(Ans[col[i]],dis[i][j] + 1);
		}
	}
	for(int i = 1;i <= n;i ++) Answer += Ans[i];
	printf("%d\n",Answer);
	return 0;
}