#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<vector>#include<map>#include<algorithm>using namespace std;#define maxn 100010#define ll long long#define rep(i,l,r,step) for(int i=l;i<=r;i+=step)bool vis2[maxn];int dis[maxn],vis1[maxn],q[maxn],edge;int n,k;ll ans;struct zs{	int to,next,dis;}e[2*maxn];int head[2*maxn];//邻接表void add(int u,int v,int value){	e[++edge].to=v;e[edge].next=head[u];head[u]=edge;e[edge].dis=value;} //最短路 bool spfa(){	int hd=0,tail=1;	q[0]=0;vis1[0]=vis2[0]=1;	while(hd!=tail){		int now=q[hd++];if(hd==maxn) hd=0;		for(int i=head[now];i;i=e[i].next){			int v=e[i].to;			if(dis[now]+e[i].dis>dis[v]){				if(++vis1[v]>=n) return 0;				dis[v]=dis[now]+e[i].dis;				if(!vis2[v]){					vis2[v]=1;q[tail++]=v;					if(tail==maxn) tail=0;				}			}		}		vis2[now]=0;	}	return 1;} int main(){	scanf("%d%d",&n,&k);	while(k--){		int x,a,b;		scanf("%d%d%d",&x,&a,&b);		if(x==1){			add(a,b,0);add(b,a,0);continue;		}		if(x==2){			if(a==b){printf("-1");return 0;}else add(a,b,1);			continue;		}		if(x==3){			add(b,a,0);continue;		}		if(x==4){			if(a==b){printf("-1");return 0;}else add(b,a,1);continue;		}		if(x==5){			add(a,b,0);continue;		}	}	for(int i=n;i;i--) add(0,i,1);	if(!spfa()){		printf("-1");return 0;	}	rep(i,1,n,1) ans+=dis[i];	printf("%lld\n",ans);	return 0;}