#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
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;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vl P(N);cin>>P;
  vector<vector<pl>>E(N+1);
  rep(i,0,M){
  	ll u,v,t;cin>>u>>v>>t;u--;v--;
  	E[u].emplace_back(v,t);
  }
  rep(i,0,N)E[N].emplace_back(i,0);
  vl D(N+1,1e18);
  D[N]=0;
  min_priority_queue<pl>Q;
  Q.emplace(D[N],N);
  while(sz(Q)){
  	auto[d,v]=Q.top();Q.pop();
  	for(auto[u,t]:E[v])if(chmin(D[u],D[v]+t))Q.emplace(D[u],u);
  }
  rep(i,0,N)for(auto&[j,t]:E[i])t+=D[i]-D[j];
  ll mi=1e18,cnt=0;
  rep(i,0,N){
  	vl DD(N,1e18);
  	DD[i]=-D[i];
  	min_priority_queue<pl>Q;
  	Q.emplace(DD[i],i);
  	while(sz(Q)){
  	  auto[d,v]=Q.top();Q.pop();
  	  if(d!=DD[v])continue;
  	  for(auto[u,t]:E[v])if(chmin(DD[u],d+t))Q.emplace(DD[u],u);
  	}
  	rep(j,0,N)DD[j]+=D[j]+P[j]+P[i];
  	rep(j,0,N)if(i!=j){
  	  if(mi>DD[j])mi=DD[j],cnt=1;
  	  else if(mi==DD[j])cnt++;
  	}
  }
  cout<<mi<<" "<<cnt<<endl;
  return 0;
}