#include <bits/stdc++.h>
using namespace std;int fa[150005], n, k;int find(int x){if(x == fa[x]) return x;return fa[x] = find(fa[x]);}void merge(int x, int y){x = find(x);y = find(y);if(x != y) fa[x] = y;}int main() {int ans = 0;cin >> n >> k;for(int i = 1; i <= 3 * n; i++)fa[i] = i;for(int i = 1; i <= k; i++){int d, x, y;cin >> d >> x >> y;if(x > n || y > n) ans ++;else if(d == 1){if(find(x) == find(y + n) || find(x) == find(y + n + n)) ans ++;else{merge(x, y);merge(x + n, y + n);merge(x + n + n, y + n + n);}}else if(d == 2){if(find(x) == find(y) || find(y) == find(x + n + n)) ans ++;else{merge(x, y + n + n);merge(x + n, y);merge(x + n + n, y + n);}}}cout << ans << endl;return 0;}