#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int N,M; cin >> N >> M;
    vector<long long> P(N);
    for(auto &p : P) cin >> p;
    long long inf = 1e16;
    vector<vector<pair<int,long long>>> Graph(N);
    for(int i=0; i<M; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        int w; cin >> w;
        Graph.at(u).push_back({v,w});
    }
    vector<long long> X(N);
    X.at(0) = 0;
    for(int t=0; t<=N; t++) for(int pos=0; pos<N; pos++) for(auto [to,w] : Graph.at(pos)){
        X.at(to) = min(X.at(to),X.at(pos)+w);
    }

    long long best = inf,answer = 0;
    for(int i=0; i<N; i++){
        vector<long long> dist(N,inf);
        dist.at(i) = 0;
        priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<>> Q;
        Q.push({0,i});
        while(Q.size()){
            auto [d,pos] = Q.top(); Q.pop();
            if(dist.at(pos) != d) continue;
            for(auto [to,w] : Graph.at(pos)){
                if(d+w+X.at(pos)-X.at(to) < dist.at(to)) dist.at(to) = d+w+X.at(pos)-X.at(to),Q.push({dist.at(to),to});
            }
        }
        for(int k=0; k<N; k++){
            if(i == k) continue;
            long long now = dist.at(k)+X.at(k)-X.at(i)+P.at(k)+P.at(i);
            if(now < best) best = now,answer = 1;
            else if(now == best) answer++;
        }
    }
    cout << best << " " << answer << endl;
}