#[allow(unused_imports)]
use std::cmp::{min,max};
#[allow(unused_imports)]
use std::collections::{BTreeMap,BTreeSet};
#[allow(unused_imports)]
use std::ops::*;
#[allow(unused_imports)]
use std::collections::BinaryHeap;

#[allow(unused_macros)]
macro_rules! ite {
    ($c:expr, $t:expr, $f:expr) => {{
        if $c { $t } else { $f }
    }};
}

// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut parser = Parser::from_str($s);
        input_inner!{parser, $($r)*}
    };
    (parser = $parser:ident, $($r:tt)*) => {
        input_inner!{$parser, $($r)*}
    };
    (new_stdin_parser = $parser:ident, $($r:tt)*) => {
        let stdin = std::io::stdin();
        let reader = std::io::BufReader::new(stdin.lock());
        let mut $parser = Parser::new(reader);
        input_inner!{$parser, $($r)*}
    };
    ($($r:tt)*) => {
        input!{new_stdin_parser = parser, $($r)*}
    };
}

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

#[macro_export]
macro_rules! read_value {
    ($parser:ident, ( $($t:tt),* )) => {
        ( $(read_value!($parser, $t)),* )
    };
    ($parser:ident, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
    };
    ($parser:ident, chars) => {
        read_value!($parser, String).chars().collect::<Vec<char>>()
    };
    ($parser:ident, usize1) => {
        read_value!($parser, usize) - 1
    };
    ($parser:ident, $t:ty) => {
        $parser.next::<$t>().expect("Parse error")
    };
}

struct UnionFindNode {
    parent: usize,
    num: usize,
    x: i64,
}

impl UnionFindNode {
    fn new(parent: usize, x: i64) -> UnionFindNode {
        UnionFindNode {
            parent: parent,
            num: 1,
            x: x,
        }
    }
}

pub struct UnionFind(Vec<UnionFindNode>, Vec<Option<(usize,usize,usize,usize,i64)>>);

impl UnionFind {
    pub fn new(n: usize, ys: &Vec<i64>) -> UnionFind {
        let mut xs = vec![];
        for i in 0..n {
            xs.push(UnionFindNode::new(i, ys[i]));
        }
        UnionFind(xs, vec![])
    }
    pub fn root(&mut self, i: usize) -> usize {
        let parent = self.0[i].parent;
        if parent == i {
            i
        }
        else {
            let res = self.root(parent);
            // self.0[i].parent = res;
            res
        }
    }
    pub fn unite(&mut self, i: usize, k: usize) {
        let i = self.root(i);
        let k = self.root(k);
        if i == k {
            self.1.push(None);
            return;
        }
        let (i,k) = if self.0[i].num < self.0[k].num {
            (i,k)
        }
        else {
            (k,i)
        };
        self.1.push(Some((i,k,self.0[i].parent,self.0[k].num,self.0[k].x)));
        self.0[i].parent = k;
        self.0[k].num += self.0[i].num;
        self.0[k].x += self.0[i].x;
    }
    pub fn back(&mut self) -> bool {
        if let Some(t) = self.1.pop() {
            if let Some((i,k,i_parent,k_num,k_x)) = t {
                self.0[i].parent = i_parent;
                self.0[k].num = k_num;
                self.0[k].x = k_x;
            }
            true
        }
        else {
            false
        }
    }
    pub fn get_x(&mut self, i: usize) -> i64 {
        let r = self.root(i);
        self.0[r].x
    }
    pub fn is_same_set(&mut self, i: usize, k: usize) -> bool {
        self.root(i) == self.root(k)
    }
    pub fn num(&mut self, i: usize) -> usize {
        let i = self.root(i);
        self.0[i].num
    }
}

#[allow(dead_code)]
const INF: i64 = 1i64 << 58;

fn main() {
    input! {
        n: usize,
        m: usize,
        xs: [i64; n],
        es: [(usize1,usize1,i64); m],
    }
    let mut es2 = vec![];
    for (i, &(s,t,w)) in es.iter().enumerate() {
        es2.push((w, i, s, t));
    }
    es2.sort();
    let es2 = es2;
    let mut res = 0;
    let mut cut = vec![false; m];
    let mut iter = 0;
    loop {
        iter += 1;
        let mut updated = false;
        let mut uf = UnionFind::new(n, &xs);
        for &(w,i,s,t) in &es2 {
            if ! cut[i] {
                uf.unite(s, t);
            }
        }
        let mut end = vec![false; n];
        for &(w,i,s,t) in es2.iter().rev() {
            if ! cut[i] {
                if end[uf.root(s)] {
                    uf.back();
                    end[uf.root(s)] = true;
                    end[uf.root(t)] = true;
                }
                else {
                    if uf.get_x(s) >= w {
                        uf.back();
                        end[uf.root(s)] = true;
                        end[uf.root(t)] = true;
                    }
                    else if uf.get_x(s) < w {
                        cut[i] = true;
                        updated = true;
                        res += 1;
                        uf.back();
                    }
                }
            }
        }
        if ! updated {
            break;
        }
    }
    println!("{}", res);
}

use std::io::BufRead;
use std::io;
use std::str;

// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}

impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}

impl<R:BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len,complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                (len, buf2[len-1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T:str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            }
            else {
                self.update_buf();
            }
        }
    }
}

struct Writer {
    s: String,
}

use std::fmt::Display;
impl Writer {
    pub fn new() -> Writer {
        Writer {
            s: String::new(),
        }
    }
    pub fn flush(&mut self) {
        print!("{}", self.s);
        self.s.clear();
    }
    pub fn write<T: Display>(&mut self, x: T) {
        self.s.push_str(&format!("{}", x));
    }
    pub fn writeln<T: Display>(&mut self, x: T) {
        self.s.push_str(&format!("{}", x));
        self.s.push('\n');
    }
    #[allow(dead_code)]
    pub fn write_vec<T: Display>(&mut self, xs: &Vec<T>) {
        if xs.len() == 0 {
            self.writeln("");
            return;
        }
        self.write(&format!("{}", xs[0]));
        for i in 1..xs.len() {
            self.write(&format!(" {}", xs[i]));
        }
        self.writeln("");
    }
}


Measured memory_bytes: 26608