#include <bits/stdc++.h>
#define NOSYNC ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) x.begin(), x.end()
#define endl '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;

const int N = 200005;

// -------------- Templates Above -------------------------

int a[N]; int n, m;
vector<int> G[N];
int vis[N]; int d[N];
vector<int> ano[N];
int tag[N], in[N];

void dfs(int x) {
	
	if(tag[x]) return;
	tag[x] = 1;
	
	if(G[x].empty() ) {
		a[x] = 1;
		return;
	}
	for(int y : G[x]) {
		if(tag[y]) continue;
		dfs(y);
	}
	for(int y : G[x]) {
		for(int z : ano[y]) {
			a[x] = max(a[x], a[y] + a[z]);
		}
	}
}

signed main() {
	NOSYNC;
	cin >> n >> m;
	for(int i = 1; i <= m; i ++) {
		int x, y, z;
		cin >> x >> y >> z;	
		G[x].push_back(y);
		G[x].push_back(z);
		++ d[y]; ++ d[z];
		ano[y].push_back(z);
		ano[z].push_back(y);
		++ in[y]; ++ in[z];
	}
	
	queue<int> q;
	for(int i = 1; i <= n; i ++) {
		if(!d[i]) {
			q.push(i);
		}
	}
	
	while(!q.empty()) {
		int u = q.front(); q.pop();
		vis[u] = 1;
		for(int v : G[u]) {
			-- d[v];
			if(!d[v]) {
				q.push(v);
			}
		}
	}
	for(int i = 1; i <= n; i ++) {
		if(!vis[i]) {
			cout << -1 << endl;
			return 0;
		}
	}
	
	for(int i = 1; i <= n; i ++) {
		if(!in[i] && !tag[i]) dfs(i);
	}
	int ans = 0;
	for(int i = 1; i <= n; i ++) {
		ans += a[i];
		if(!a[i]) ans ++;
	}
	cout << ans << endl;
	
	return 0;
}