Задача на алгоритм Дейкстры

var
j,i,R,r2,n,k:longint;
w,a:array[1..50,1..50] of longint;
p,d,mark,s1,s2,we:array[1..100] of longint;
wet:array[1..10] of string;
mi,nq,inf,l,st,s,uk,m,aa,bb,b,ans,x,x1,x2,x3,y1,y2,y3,nn,y,q1,z1,c:longint;
ch:char;
 
input,output:text;
 
function min(a,b:longint):longint;
begin
if a< b then min:=a else min:=b;
end;
begin
 
 {assign(input, 'input.txt'); reset(input);
  assign(output, 'output.txt'); rewrite(output);}
{writeln (round(sqrt(2147483647)));}
inf:=30000;
read (n);
  st:=-1;
  for i:=1 to n do
    for j:=1 to n do
      begin a[i,j]:=st;w[i,j]:=st;end;
 
for i:=1 to n do
begin read (we[i]);d[i]:=inf;end;
 
read (m);
 
for i:=1 to m do
 begin
 read (k,l);a[k,l]:=1;a[l,k]:=1;w[k,l]:=we[k];w[l,k]:=we[l];
 end;
 
 
{tut ne znau chto delat}
for i:=1 to n do
 for j:=i+1 to n do
  if a[i,j]<>st then begin
                     for k:=j+1 to n do
                      if a[j,k]<>st then w[j,k]:=min(w[j,k],we[i]);
                     end;
 
 
{dijkstra}
d[1]:=0;
nq:=n;
while nq<>0 do
begin
  mi:=inf;
  for i:=1 to n do
   if (mark[i]=0)and(d[i]<mi) then begin uk:=i;mi:=d[i];end;
  dec(nq);
  mark[uk]:=1;
 
  for i:=1 to n do
    if (w[uk,i]<>st) then begin
                if d[i]>d[uk]+w[uk,i] then begin d[i]:=d[uk]+w[uk,i];p[i]:=uk;end;
                            end;
end;
 
 
{vivod}
if d[n]=inf then write ('-1') else writeln (d[n]);
 end.