use std::collections::VecDeque;

fn main() {
    let s = std::io::stdin();
    let mut sc = Scanner { reader: s.lock() };
    let n: usize = sc.read();
    let m: usize = sc.read();
    let x: Vec<usize> = sc.read_vec(n);
    let mut uf = UnionFind {
        parent: (0..n).map(|i| i).collect(),
        sizes: vec![1; n],
        weights: x,
        size: n,
    };

    let mut edges = vec![];
    for _ in 0..m {
        let a = sc.read::<usize>() - 1;
        let b = sc.read::<usize>() - 1;
        let w = sc.read::<usize>();
        edges.push((w, a, b));
    }
    edges.sort();

    let mut is_candidate = vec![false; m];

    let mut cur = 0;
    while cur < m {
        let (cur_w, _, _) = edges[cur];
        let mut tmp = vec![];
        for i in cur..m {
            let (w, a, b) = edges[i];
            if w != cur_w {
                break;
            }
            tmp.push((w, a, b, i));
            uf.unite(a, b);
        }

        for &(w, a, _, i) in tmp.iter() {
            let root = uf.find(a);
            let weight = uf.weights[root];
            if weight >= w {
                is_candidate[i] = true;
            }
        }

        cur += tmp.len();
    }

    let mut graph = vec![vec![]; n];
    for i in 0..m {
        let (_, a, b) = edges[i];
        graph[a].push((i, b));
        graph[b].push((i, a));
    }

    let mut q = VecDeque::new();
    let mut used = vec![false; m];
    for i in (0..m).rev() {
        if used[i] {
            continue;
        }
        if is_candidate[i] {
            let (w, a, b) = edges[i];
            q.push_back(a);
            q.push_back(b);
            used[i] = true;
            while let Some(v) = q.pop_back() {
                for &(i, next) in graph[v].iter() {
                    if !used[i] && edges[i].0 <= w {
                        q.push_back(next);
                        used[i] = true;
                    }
                }
            }
        }
    }

    println!("{}", m - used.iter().filter(|&&u| u).count());
}

pub struct UnionFind {
    parent: Vec<usize>,
    sizes: Vec<usize>,
    weights: Vec<usize>,
    size: usize,
}

impl UnionFind {
    pub fn find(&mut self, x: usize) -> usize {
        if x == self.parent[x] {
            x
        } else {
            let px = self.parent[x];
            self.parent[x] = self.find(px);
            self.parent[x]
        }
    }

    pub fn unite(&mut self, x: usize, y: usize) -> bool {
        let parent_x = self.find(x);
        let parent_y = self.find(y);
        if parent_x == parent_y {
            return false;
        }

        let (large, small) = if self.sizes[parent_x] < self.sizes[parent_y] {
            (parent_y, parent_x)
        } else {
            (parent_x, parent_y)
        };

        self.parent[small] = large;
        self.sizes[large] += self.sizes[small];
        self.sizes[small] = 0;
        self.weights[large] += self.weights[small];
        self.weights[small] = 0;
        self.size -= 1;
        return true;
    }
}

pub struct Scanner<R> {
    reader: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .reader
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n')
            .take_while(|&b| b != b' ' && b != b'\n')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 20696