use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        n: usize,
        m: usize,
        p: [i64; n],
        e: [(usize1, usize1, i64); m],
    }
    let g = johnson(n, &e);
    let mut ans = (std::i64::MAX, 0);
    for a in 0..n {
        for b in 0..n {
            if a == b {
                continue;
            }
            let d = p[a] + p[b] + g[a][b];
            if ans.0 > d {
                ans = (d, 0);
            }
            if ans.0 == d {
                ans.1 += 1;
            }
        }
    }
    println!("{} {}", ans.0, ans.1);
}

fn johnson(n: usize, e: &[(usize, usize, i64)]) -> Vec<Vec<i64>> {
    let mut g = vec![vec![]; n];
    for &(s, t, w) in e.iter() {
        g[s].push((t, w));
    }
    let mut dp = vec![0; n];
    let mut deq = (0..n).collect::<std::collections::VecDeque<_>>();
    let mut on = vec![true; n];
    while let Some(v) = deq.pop_front() {
        let d = dp[v];
        on[v] = false;
        for &(u, w) in g[v].iter() {
            if dp[u].chmin(d + w) && !on[u] {
                deq.push_back(u);
                on[u] = true;
            }
        }
    }
    let po = dp;
    let mut res = vec![];
    //let mut h = std::collections::BinaryHeap::new();
    let mut h = RadixHeap::new();
    for src in 0..n {
        let mut dp = vec![std::i64::MAX / 3; n];
        dp[src] = 0;
        h.init();
        h.push(0, src);
        while let Some((d, v)) = h.pop() {
            let d = d as i64;
            if d > dp[v] {
                continue;
            }
            for &(u, w) in g[v].iter() {
                let d = d + w + po[v] - po[u];
                if dp[u].chmin(d) {
                    h.push(d as u64, u);
                }
            }
        }
        for (i, dp) in dp.iter_mut().enumerate() {
            *dp += po[i] - po[src];
        }
        res.push(dp);
    }
    res
}

// ---------- 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 radix heap ----------
pub trait RadixKeyType: Copy + Ord + std::ops::BitXor<Output = Self> {
    fn leading_zeros(self) -> usize;
    fn zero() -> Self;
    const SIZE: usize = std::mem::size_of::<Self>() * 8;
    fn bsr(self) -> usize {
        Self::SIZE - self.leading_zeros() as usize
    }
}

pub struct RadixHeap<K, V> {
    buf: Vec<Vec<(K, V)>>,
    last: K,
}

impl<K, V> RadixHeap<K, V>
where
    K: RadixKeyType,
{
    pub fn new() -> Self {
        RadixHeap {
            buf: (0..K::SIZE).map(|_| vec![]).collect(),
            last: K::zero(),
        }
    }
    pub fn init(&mut self) {
        self.buf.iter_mut().for_each(|p| p.clear());
        self.last = K::zero();
    }
    pub fn push(&mut self, key: K, val: V) {
        assert!(self.last <= key);
        self.buf[(self.last ^ key).bsr()].push((key, val));
    }
    pub fn pop(&mut self) -> Option<(K, V)> {
        if self.buf[0].is_empty() {
            if let Some(x) = self.buf.iter().position(|a| !a.is_empty()) {
                let mut a = std::mem::take(&mut self.buf[x]);
                self.last = a.iter().map(|p| p.0).min().unwrap();
                for (key, val) in a.drain(..) {
                    self.buf[(self.last ^ key).bsr()].push((key, val));
                }
                self.buf[x] = a;
            }
        }
        self.buf[0].pop()
    }
}

macro_rules! impl_radix_key_type {
    ($x: ty) => {
        impl RadixKeyType for $x {
            fn leading_zeros(self) -> usize {
                self.leading_zeros() as usize
            }
            fn zero() -> Self {
                0
            }
        }
    };
}

impl_radix_key_type!(u64);
impl_radix_key_type!(u32);
impl_radix_key_type!(usize);
// ---------- end radix heap ----------
// ---------- begin chmin, chmax ----------
pub trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------