s=(1..n=gets.to_i).map{gets.to_i}
c=(1..n).map{{}}
gets.to_i.times{
  a,b,d=gets.split.map(&:to_i)
  c[a][b]=c[b][a]=d
}
q=[[0,0,[0,n-1]],[1e9]]
gn={}
while q[0]&&(q[0][1]<n-1||q[0][2].size<4)
  cost,cur,st=q.shift
  next if gn[[cur,st]]
  gn[[cur,st]]=1
  ad=(st.size<4&&!st.include?(cur))?[[cost+s[cur],cur,(st+[cur]).sort]]:[]
  c[cur].each{|k,v|ad<<[cost+v,k,st]}
  ad.each{|i|q.insert((0..q.size).bsearch{|j|q[j][0]>=i[0]},i)if !gn[[i[1],i[2]]]}
end
p q[0][0]