#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr long long INF = 1002003004005006007;
vector<long long> dijkstra(const auto& to, int s = 0) {
  struct QueElem {
    int v;
    long long d;
    bool operator<(const QueElem& a) const { return d > a.d; }
    QueElem(int v, long long d) : v(v), d(d) {}
  };
  priority_queue<QueElem> q;
  vector<long long> dist(to.size(), INF);
  dist[s] = 0;
  q.emplace(s, 0);
  while (!q.empty()) {
    auto [u, d] = q.top(); q.pop();
    if (d > dist[u]) continue;
    for (auto [v, dv] : to[u]) {
      long long nd = d + dv;
      if (nd < dist[v]) {
        dist[v] = nd;
        q.emplace(v, nd);
      }
    }
  }
  return dist;
}


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI p(n);
  rep(i, n) cin >> p[i];
  vector<tuple<int, int, int>> edge(m);
  for (auto& [u, v, t] : edge) cin >> u >> v >> t, u--, v--;
  VI pot(n);
  while (true) {
    bool upd = false;
    for (auto [u, v, t] : edge) upd |= chmin(pot[v], pot[u] + t);
    if (!upd) break;
  }
  vector<vector<P>> g(n);
  for (auto [u, v, t] : edge) {
    // pot[v] <= pot[u] + t
    int d = pot[u] - pot[v] + t;
    assert(d >= 0);
    g[u].emplace_back(v, d);
  }
  ll ans = INF;
  int cnt = 0;
  rep(s, n) {
    auto dist = dijkstra(g, s);
    rep(t, n) if (s != t) {
      ll cost = dist[t] - pot[s] + pot[t] + p[s] + p[t];
      if (cost == ans) cnt++;
      else if (chmin(ans, cost)) {
        cnt = 1;
      }
    }
  }
  cout << ans << ' ' << cnt << '\n';
}