#include <cstdio>

 const int Maxn=;

 int F[Maxn*],n,k,Type,x,y,Ans;

 int Get(int x) {return F[x]==x?x:F[x]=Get(F[x]);}

 int main()

 {

     scanf("%d%d",&n,&k);

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

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

     {

         scanf("%d%d%d",&Type,&x,&y);

         if (x>n || y>n || (x==y && Type==))

         {

             Ans++;

             continue;

         }

         if (Type==)

         {

             if (Get(x)==Get(y+n) || Get(x)==Get(y+*n))

             {

                 Ans++;

                 continue;

             }

             F[Get(x)]=Get(y);

             F[Get(x+n)]=Get(y+n);

             F[Get(x+*n)]=Get(y+*n);

         } else

         {

             if (Get(x)==Get(y) || Get(x)==Get(y+*n))

             {

                 Ans++;

                 continue;

             }

             F[Get(x)]=Get(y+n);

             F[Get(x+n)]=Get(y+*n);

             F[Get(x+*n)]=Get(y);

         }

     }

     printf("%d\n",Ans);

     return ;

 }

#include <cstdio>

int Sum[],Father[],n,m,Count,u,v,w;

int Get_Father(int x)

{

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

    int Tmp=Get_Father(Father[x]);

    Sum[x]+=Sum[Father[x]];

    return Father[x]=Tmp;

}

int main()

{

    while (scanf("%d%d",&n,&m)!=EOF)

    {

        for (int i=;i<=n;i++) Father[i]=i,Sum[i]=;

        Count=;

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

        {

            scanf("%d%d%d",&u,&v,&w);

            int fu=Get_Father(u),fv=Get_Father(v);

            if (fu!=fv)

            {

                Father[fu]=fv;

                Sum[fu]=Sum[v]+w-Sum[u];

            } else

            {

                if (Sum[u]-Sum[v]!=w)

                    Count++;

            }

        }

        printf("%d\n",Count);

    }

    return ;

}

 #include <cstdio>

 int KASE,n,m,u,v,w;

 int Father[],Sum[];

 int Get_Father(int x)

 {

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

     int Tmp=Get_Father(Father[x]);

     Sum[x]+=Sum[Father[x]];

     Father[x]=Tmp;

     return Tmp;

 }

 int main()

 {

     scanf("%d",&KASE);

     for (int Kase=;Kase<=KASE;Kase++)

     {

         scanf("%d%d",&n,&m); bool flag=false;

         for (int i=;i<=n;i++) Father[i]=i,Sum[i]=;

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

         {

             scanf("%d%d%d",&u,&v,&w);

             int fu=Get_Father(u-),fv=Get_Father(v);

             if (fu==fv)

             {

                 if (Sum[u-]-Sum[v]!=w)

                 {

                     flag=true;

                     break;

                 }

             } else

             {

                 Father[fu]=fv;

                 Sum[fu]=Sum[v]-Sum[u-]+w;

             }

         }

         puts(flag?"false":"true");

     }

     return ;

 }