use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;

fn run() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1, u32); m],
    }
    let mut map = Map::new();
    for &(a, b, c) in e.iter() {
        let (s, t) = (a.min(b), a.max(b));
        *map.entry((s, t)).or_insert(0) |= 1 << c;
    }
    let mut e = map.into_iter().map(|((a, b), c)| (a, b, c)).collect::<Vec<_>>();
    let mut ans = n;
    ans += e.iter().filter(|e| e.2 == 3).count();
    enumerate_triangles(n, e.clone(), |_, _, _, x, y, z| {
        let mut cnt = [0; 2];
        for &a in [x, y, z].iter() {
            if a & 1 == 1 {
                cnt[0] += 1;
            }
            if a & 2 == 2 {
                cnt[1] += 1;
            }
        }
        if (cnt[0], cnt[1]) == (2, 2) {
            ans += 1;
        }
    });
    let mut dsu = DSU::new(n);
    for &(a, b, _) in e.iter() {
        if let Some((p, c)) = dsu.unite(a, b) {
        }
    }
    e.retain(|e| dsu.size(e.0) == 4);
    let mut g = vec![vec![]; n];
    for &(a, b, c) in e.iter() {
        g[a].push((b, c));
        g[b].push((a, c));
    }
    let mut red = DSU::new(n);
    let mut blue = DSU::new(n);
    let mut used = vec![false; n];
    for i in 0..n {
        let r = dsu.root(i);
        if used[r] || g[r].len() == 0 {
            continue;
        }
        let mut dfs = vec![i];
        used[i] = true;
        while let Some(v) = dfs.pop() {
            for &(u, c) in g[v].iter() {
                if c == 1 {
                    red.unite(v, u);
                } else {
                    blue.unite(v, u);
                }
                if !used[u] {
                    used[u] = true;
                    dfs.push(u);
                }
            }
        }
        if red.size(i) == 4 && blue.size(i) == 4 {
            ans += 1;
        }
    }
    println!("{}", ans);
}

fn main() {
    run();
}

pub fn enumerate_triangles<F>(n: usize, e: Vec<(usize, usize, u32)>, mut f: F)
where
    F: FnMut(usize, usize, usize, u32, u32, u32),
{
    assert!(e.iter().all(|e| e.0 != e.1 && e.0.max(e.1) < n));
    let mut deg = vec![0; n];
    for e in e.iter() {
        deg[e.0] += 1;
        deg[e.1] += 1;
    }
    let mut g = deg
        .iter()
        .map(|d| Vec::with_capacity(*d))
        .collect::<Vec<_>>();
    for &(mut a, mut b, c) in e.iter() {
        if (deg[a], a) > (deg[b], b) {
            std::mem::swap(&mut a, &mut b);
        }
        g[a].push((b, c));
    }
    let mut elem = vec![(false, 0); n];
    for (a, ga) in g.iter().enumerate() {
        for &(b, ab) in ga.iter() {
            for &c in g[b].iter() {
                elem[c.0] = (true, c.1);
            }
            for &ac in ga.iter() {
                if elem[ac.0].0 {
                    f(a, b, ac.0, ab, ac.1, elem[ac.0].1);
                }
            }
            for &c in g[b].iter() {
                elem[c.0] = (false, 0);
            }
        }
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
//---------- begin union_find ----------
pub struct DSU {
    p: Vec<i32>,
}
impl DSU {
    pub fn new(n: usize) -> DSU {
        assert!(n < std::i32::MAX as usize);
        DSU { p: vec![-1; n] }
    }
    pub fn init(&mut self) {
        self.p.iter_mut().for_each(|p| *p = -1);
    }
    pub fn root(&self, mut x: usize) -> usize {
        assert!(x < self.p.len());
        while self.p[x] >= 0 {
            x = self.p[x] as usize;
        }
        x
    }
    pub fn same(&self, x: usize, y: usize) -> bool {
        assert!(x < self.p.len() && y < self.p.len());
        self.root(x) == self.root(y)
    }
    pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> {
        assert!(x < self.p.len() && y < self.p.len());
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y {
            return None;
        }
        if self.p[x] > self.p[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.p[x] += self.p[y];
        self.p[y] = x as i32;
        Some((x, y))
    }
    pub fn parent(&self, x: usize) -> Option<usize> {
        assert!(x < self.p.len());
        let p = self.p[x];
        if p >= 0 {
            Some(p as usize)
        } else {
            None
        }
    }
    pub fn sum<F>(&self, mut x: usize, mut f: F) -> usize
    where
        F: FnMut(usize),
    {
        while let Some(p) = self.parent(x) {
            f(x);
            x = p;
        }
        x
    }
    pub fn size(&self, x: usize) -> usize {
        assert!(x < self.p.len());
        let r = self.root(x);
        (-self.p[r]) as usize
    }
}
//---------- end union_find ----------