#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

static constexpr ll inf = 1000000000000000000;

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> p(n);
  rep(i,0,n) cin >> p[i];
  vector<int> u(m), v(m), t(m);
  rep(i,0,m) {
    cin >> u[i] >> v[i] >> t[i];
    --u[i], --v[i];
  }
  vector<ll> pt(n, 0);
  rep(j,0,n) {
    rep(i,0,m) {
      if (pt[v[i]] > pt[u[i]]+t[i]) {
        pt[v[i]] = pt[u[i]]+t[i];
      }
    }
  }
  // rep(i,0,n) cout << pt[i] << " ";
  // cout << endl;
  vector<vector<pair<int,ll>>> G(n);
  rep(i,0,m) {
    G[u[i]].eb(v[i], pt[u[i]]+t[i]-pt[v[i]]);
    // cout << pt[u[i]]+t[i]-pt[v[i]] << endl;
  }
  pq<pair<ll,int>> que;
  ll ans = inf; int cnt = 0;
  rep(s,0,n) {
    vector<ll> dist(n, inf);
    dist[s] = 0;
    que.emplace(0, s);
    while(!que.empty()) {
      ll c; int v;
      tie(c, v) = que.top();
      que.pop();
      if (dist[v] < c) continue;
      for (auto [nv, cost] : G[v]) {
        if (dist[nv] > dist[v]+cost) {
          dist[nv] = dist[v]+cost;
          que.emplace(dist[nv], nv);
        }
      }
    }
    rep(i,0,n) {
      if (i == s || dist[i] == inf) continue;
      ll val = dist[i]-pt[s]+pt[i]+p[s]+p[i];
      if (ans > val) {
        ans = val, cnt = 1;
      } else if (ans == val) {
        ++cnt;
      }
    }
  }
  cout << ans << " " << cnt << endl;
  return 0;
}