#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

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

fn dfs(
    cur: usize,
    max_cost: i64,
    edges: &Vec<Vec<(usize, i64)>>,
    checked: &mut Vec<bool>,
    uft: &mut UnionFindTree,
) {
    if checked[cur] {
        return;
    }
    checked[cur] = true;
    for &(to, cost) in edges[cur].iter() {
        if checked[to] || cost > max_cost {
            continue;
        }
        uft.unite(cur, to);
        dfs(to, max_cost, edges, checked, uft);
    }
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m) = (v[0], v[1]);
    let x = read_vec::<i64>();
    let mut edges = vec![];
    let mut graph = vec![vec![]; n];
    for i in 0..m {
        let v = read_vec::<i64>();
        let (a, b, c) = (v[0] as usize - 1, v[1] as usize - 1, v[2]);
        edges.push((c, a, b));
        graph[a].push((b, c));
        graph[b].push((a, c));
    }
    edges.sort();
    let mut sum = x.clone();

    let mut ok = vec![0; n];

    let mut uft = UnionFindTree::new(n);
    for &(y, a, b) in edges.iter() {
        let mut a = uft.find(a);
        let mut b = uft.find(b);
        if uft.same(a, b) {
            continue;
        }
        uft.unite(a, b);
        if a != uft.find(a) {
            std::mem::swap(&mut a, &mut b);
        }
        sum[a] += sum[b];
        if y <= sum[a] {
            ok[a] = y;
        }
    }

    let mut uft = UnionFindTree::new(n);
    let mut indexes = (0..n).collect::<Vec<_>>();
    indexes.sort_by_key(|&i| ok[i]);
    indexes.reverse();

    debug!(ok);
    debug!(sum);
    debug!(indexes);

    let mut checked = vec![false; n];
    for i in indexes {
        if !checked[i] {
            dfs(i, ok[i], &graph, &mut checked, &mut uft);
        }
    }

    let ans = m - edges
        .iter()
        .filter(|&&(y, a, b)| uft.same(a, b) && ok[uft.find(a)] <= y)
        .count();

    println!("{}", ans);
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find(x) == self.find(y)
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}
