#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const long long INF = 1e18;

struct Edge {
    int to;
    long long cost;
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N, M;
    if (!(cin >> N >> M)) return 0;

    vector<long long> P(N + 1);
    for (int i = 1; i <= N; ++i) cin >> P[i];

    vector<vector<Edge>> adj(N + 1);
    for (int i = 0; i < M; ++i) {
        int u, v;
        long long t;
        cin >> u >> v >> t;
        adj[u].push_back({v, t});
    }

    long long min_total_cost = INF;
    long long min_count = 0;

    for (int start = 1; start <= N; ++start) {
        vector<long long> dist(N + 1, INF);
        vector<int> pop_count(N + 1, 0); // キューから取り出した回数
        
        // {distance, node}
        priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;

        dist[start] = 0;
        pq.push({0, start});

        while (!pq.empty()) {
            auto [d, u] = pq.top();
            pq.pop();

            // 古い情報ならスキップ
            if (d > dist[u]) continue;

            pop_count[u]++;
            // 嘘の要：1つの頂点を展開するのは最大20回まで（TLE回避）
            if (pop_count[u] > 20) continue;

            for (auto& edge : adj[u]) {
                int v = edge.to;
                long long weight = edge.cost;
                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.push({dist[v], v});
                }
            }
        }

        for (int v = 1; v <= N; ++v) {
            if (start == v || dist[v] == INF) continue;
            long long current_cost = dist[v] + P[start] + P[v];
            if (current_cost < min_total_cost) {
                min_total_cost = current_cost;
                min_count = 1;
            } else if (current_cost == min_total_cost) {
                min_count++;
            }
        }
    }

    if (min_total_cost == INF) cout << -1 << "\n";
    else cout << min_total_cost << " " << min_count << "\n";

    return 0;
}