#include <iostream>

using namespace std;

const int N = 500010;

int n, m;
int p[N], d[N];

int find(int x)
{
    if (p[x] != x)
    {
        int t = find(p[x]);  // t暂存p[x]的祖宗结点(也是x的祖宗结点)
        d[x] += d[p[x]];  // x->p[x]距离 + p[x]->祖宗结点距离 d[x]更新为x到祖宗结点的距离
        p[x] = t;  // p[x]指向x的祖宗结点
    }
    return p[x];
}

int main()
{
    cin >> n >> m;

    for (int i = 1; i <= n; i ++ ) p[i] = i;

    int res = 0;
    while (m -- )
    {
        int t, x, y;
        scanf("%d%d%d", &t, &x, &y);

        if (x > n || y > n) res ++;
        else 
        {
            int px = find(x), py = find(y);
            if (t == 1)
            {
                if (px == py && (d[x] - d[y]) % 3) res ++;
                else if (px != py)
                {
                    p[px] = py;
                    d[px] = d[y] - d[x];  // (d[px](?) + d[x] - d[y]) % 3 == 0 
                }
            }
            else
            {
                if (px == py && (d[x] - d[y] - 1) % 3) res ++;
                else if (px != py)
                {
                    p[px] = py;  // px->py
                    d[px] = d[y] + 1 - d[x];  // (d[px)(?) + d[x] - d[y]) % 3 == 1
                }
            }
        }
    }

    cout << res;
    return 0;
}