/* -*- coding: utf-8 -*-
 *
 * 3653.cc:  No.3653 Space-Time Courier - yukicoder
 */

#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<utility>

using namespace std;

/* constant */

const int MAX_N = 2500;
const long long LINF = 1LL << 60;

/* typedef */

using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using vpii = vector<pii>;

/* global variables */

int ps[MAX_N];
vpii nbrs[MAX_N];
ll ds[MAX_N];

/* subroutines */

void dijkstra(int n, int st, ll ds[]) {
  fill(ds, ds + n, LINF);
  ds[st] = 0;
  priority_queue<pli> q;
  q.push({0, st});

  while (! q.empty()) {
    auto [ud, u] = q.top(); q.pop();
    ud = -ud;
    if (ds[u] != ud) continue;

    for (auto [v, w]: nbrs[u]) {
      int vd = ud + w;
      if (ds[v] > vd)
	ds[v] = vd, q.push({-vd, v});
    }
  }
}

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", ps + i);
  for (int i = 0; i < m; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    u--, v--;
    nbrs[u].push_back({v, w});
  }

  ll minsum = LINF;
  int minc = 0;
  for (int st = 0; st < n; st++) {
    dijkstra(n, st, ds);

    for (int u = 0; u < n; u++)
      if (u != st) {
	ll sum = ds[u] + ps[st] + ps[u];
	if (minsum > sum) minsum = sum, minc = 1;
	else if (minsum == sum) minc++;
      }
  }

  printf("%lld %d\n", minsum, minc);
  
  return 0;
}