#include <cstring>

 #include <cstdio>

 #include <string>

 #include <iostream>

 #include <algorithm>

 #include <vector>

 using namespace std;

 int o[];

 int flag[];

 int ans;

 int find(int x)

 {

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

     int t = find(o[x]);

     flag[x] = (flag[o[x]] + flag[x]) % ;

     return o[x] = t;

 }

 void judge1(int x,int y)

 {

     int tx,ty;

     tx = find(x);

     ty = find(y);

     if(tx != ty)

     {

         o[tx] = ty;

         flag[tx] = (flag[y] - flag[x] + )%;

     }

     else if(tx == ty)

     {

         if(flag[x] != flag[y])

             ans ++;

     }

 }

 void judge2(int x,int y)//x吃y

 {

     int tx,ty;

     tx = find(x);

     ty = find(y);

     if(tx != ty)

     {

         o[tx] = ty;

         flag[tx] = (flag[y] - flag[x] + )%;

     }

     else if(tx == ty)

     {

         if((flag[x]-flag[y]+)% != )

             ans ++;

     }

 }

 int main()

 {

     int n,m,num,sv,ev,i;

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

     ans = ;

     for(i = ; i <= n; i ++)

     {

         o[i] = i;

         flag[i] = ;

     }

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

     {

         scanf("%d%d%d",&num,&sv,&ev);

         if(sv > n||ev > n)

         {

             ans ++;

             continue;

         }

         if(num == )

         {

             judge1(sv,ev);

         }

         else

         {

             judge2(sv,ev);

         }

     }

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

     return ;

 }