import sys
# input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from heapq import *
INF = 10**18
def dijkstra(g, s, n):
    dist = [INF]*n
    hq = [(0, s)]
    dist[s] = 0
    while hq:
        d, v = heappop(hq)
        if dist[v]!=d:
            continue
        for to, c in g[v]:
            if dist[v] + c < dist[to]:
                dist[to] = dist[v] + c
                heappush(hq, (dist[to], to))
    return dist
n, m = na()
p = na()
E = []
for _ in range(m):
    u, v, w = na()
    u -= 1
    v -= 1
    E.append((u, v, w))

dist = [0] * n
for _ in range(n):
    for u, v, w in E:
        dist[v] = min(dist[v], dist[u] + w)
g = [[] for i in range(n)]
for u, v, w in E:
    g[u].append((v, w - dist[v] + dist[u]))
    # print(u, v, w - dist[v] + dist[u])

ans = 10 ** 18
cnt = 0
for v in range(n):
    # print(v)
    a = dijkstra(g, v, n)
    for i in range(n):
        if i == v:
            continue
        z = p[v] + p[i] + a[i] - dist[v] + dist[i]
        # print(v, i, z)
        if ans > z:
            ans = z
            cnt = 1
        elif ans == z:
            cnt += 1

print(ans, cnt)