#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

#[derive(Eq, PartialEq, Clone, Debug)]
pub struct Rev<T>(pub T);
impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}
impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

fn solve() {
    let (n,m) = get!(usize,usize);
    let abc = get!(usize, usize, usize;m);

    let mut nodes = vec![Vec::new(); n+1];
    for (a,b,c) in abc {
        nodes[a].push((b,c));
        nodes[b].push((a,c));
    }

    let mut in_route = BTreeSet::new();
    for start in 1..n+1 {
        for goal in (start+1)..n+1 {
            let mut heap = BinaryHeap::new();
            let mut visited = BTreeMap::<usize, (BTreeSet<_>, usize)>::new();
            heap.push(Rev((0, start, 0)));
            let mut gflag = false;
            while let Some(Rev((cost, node, bnode))) = heap.pop() {
                if gflag && node != goal {
                    break;
                }
                if let Some(beforenode) = visited.get_mut(&node) {
                    if beforenode.1 == cost {
                        beforenode.0.insert(bnode);
                    }
                    continue;
                }
                visited.insert(node, (vec![bnode].into_iter().collect::<BTreeSet<_>>(), cost));
                if node == goal {
                    gflag = true;
                    continue;
                }
                for &(next, ncost) in &nodes[node] {
                    if visited.contains_key(&next) {
                        continue;
                    }
                    heap.push(Rev((cost+ncost, next, node)));
                }
            }
            let mut cnodes = VecDeque::new();
            cnodes.push_back(goal);
            while let Some(cnode) = cnodes.pop_front() {
                if cnode == start {
                    continue;
                }
                if let Some(&(ref nextset, _)) = visited.get(&cnode) {
                    for &next in nextset {
                        in_route.insert((next, cnode));
                        in_route.insert((cnode, next));
                        cnodes.push_back(next);
                    }
                }
            }
        }
    }
    println!("{}", m-in_route.len()/2);
}


Measured memory_bytes: 8572