# haru: pypy
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

"""
うーん？？？
あれか、書いたこと無い
"""

n, m = MI()
p = LI()

e = []
for i in range(m):
    u, v, w = MI()
    e.append((u-1, v-1, w))

# s -> a -> b
d = [0] * n
for i in range(n):
    ok = 1
    for u, v, w in e:
        if d[v] > d[u] + w:
            d[v] = d[u] + w
            ok = 0
    if ok:
        break
    
# print(d)

e2 = [[] for i in range(n)]
for u, v, w in e:
    e2[u].append((v, w + d[u] - d[v]))

ans = inf
cnt = 0

for s in range(n):
    d2 = [inf] * n
    d2[s] = 0
    que = [(0, s)]
    while que:
        nd, u = heappop(que)
        if nd != d2[u]: continue
        
        for v, w in e2[u]:
            if d2[v] > d2[u] + w:
                d2[v] = d2[u] + w
                heappush(que, (d2[u] + w, v))
    
    
    for t in range(n):
        if t == s: continue
        
        td = d2[t] - d[s] +  d[t] # 復元した距離
        
        x = p[s] + td + p[t]
        if x < ans:
            ans = x
            cnt = 1
        elif x == ans:
            cnt += 1 
        
        # print(s, t, td)

print(ans, cnt)