#include<cstdio>
#include<cstring>
using namespace std;
#define N 50010
int n,fa[N],d[N];

void Init(){
    for(int i=1;i<=n;i++){
        fa[i]=i;
        d[i]=0;
    }   
}

int Find(int x){
    int fx=fa[x];
    if(x!=fa[x]){
        fa[x]=Find(fa[x]);
        d[x]=(d[x]+d[fx])%3;
    }   
    return fa[x];
}

int main(){
    int k,c,x,y,total=0,a,b;
    scanf("%d%d",&n,&k);
    Init();
    while(k--){
        scanf("%d%d%d",&c,&x,&y);
        if(x>n||y>n||(c==2&&x==y))
            total++;
        else{
            a=Find(x),b=Find(y);
            if(a==b){
                if((d[x]-d[y]+3)%3!=c-1)
                    total++;
            }
            else{
                fa[a]=b;
                d[a]=(d[y]-d[x]+3+c-1)%3;
            }
        }
    }
    printf("%d\n",total);
    return 0;
}