const max=99999 ;
var
 n,m,u,v,s,i,j,k,a,b,c,ans:longint;
 f:array[0..10000]of longint;
 t:array[0..10000,0..10000]of longint;
 w:array[0..10000,0..10000]of longint;
 g:array[0..10000,0..10000]of boolean;

begin
assign(input,'cost.in');reset(input);
assign(output,'cost.out');rewrite(output);
readln(n,m,u,v,s);
for i:=1 to n do readln(f[i]);
for i:=1 to n do
  for j:=1 to n do
     begin  t[i,j]:=f[i];end;

fillchar(g,sizeof(g),false);
for i:=1 to n do
    begin readln(a,b,c);t[a,b]:=c;t[b,a]:=c;
          g[a,b]:=true;g[b,a]:=true;
    end;
for k:=1 to n do
  for i:=1 to n do
    for j:=1 to n do
      if (t[i,j]>t[i,k]+t[k,j])or(t[i,j]=0) then
        begin
        t[i,j]:=t[i,k]+t[k,j];t[j,i]:=t[i,k]+t[k,j];
        end;
if t[u,v]=0 then begin writeln('-1');close(input);close(output);halt;end;

for k:=1 to n do
  for i:=1 to n do
    for j:=1 to n do
      if w[i,j]>w[i,k]+w[k,j] then
                w[i,j]:=w[i,k]+w[k,j];
writeln(w[u,v]);

close(input);close(output);
end.