#include<iostream>

#include<stdio.h>

#include<cstring>

#include<queue>

#include<map>

#include<stdlib.h>

using namespace std;

int f[];

int find(int x)

{

    if(f[x]==x)return x;

    return f[x]=find(f[x]);

}

void he(int x,int y)

{

    x=find(x);

    y=find(y);

    if(x==y)return;

    f[y]=x;

}

int main()

{

    int n,m,ans=;

    cin>>n>>m;

    for (int i=;i<=*n;i++)f[i]=i;

    for (int i=;i<=m;i++)

    {

        int op,x,y;

        cin>>op>>x>>y;

        if (x<||y<||x>n||y>n||(x==y&&op==))ans++;

        else

        {

            if (op==)

            {

                if (find(x)==find(y+n)||find(x)==find(y+*n))ans++;

                else

                {

                    he(x,y);

                    he(x+n,y+n);

                    he(x+*n,y+*n);

                }

            }

            else

            {

                if (find(x)==find(y)||find(y+*n)==find(x))ans++;

                else

                {

                    he(x,y+n);

                    he(x+n,y+*n);

                    he(x+*n,y);

                }

            }

        }

    }

    cout<<ans;

}