#include <algorithm>

 #include <cstdio>

 #define min(a,b) (a<b?a:b)

 inline void read(int &x)

 {

     x=; register char ch=getchar();

     for(; ch>''||ch<''; ) ch=getchar();

     for(; ch>=''&&ch<=''; ch=getchar()) x=x*+ch-'';

 }

 const int N();

 int n,m,dis[N][N];

 struct Road {

     int u,v,w;

     Road(int u=,int v=,int w=):u(u),v(v),w(w){;}

     bool operator < (const Road&x) const { return w<x.w; }

 }road[N*N];

 int fa[N];

 int find(int x) { return x==fa[x]?x:fa[x]=find(fa[x]); }

 int Presist()

 {

     read(n);

     for(int i=; i<=n; ++i) read(dis[][i]);

     for(int x,i=; i<=n; ++i)

       for(int j=; j<=n; ++j)

         read(x),dis[i][j]=(i!=j)?x:dis[i][j];

     for(int i=; i<=n; ++i)

       for(int j=; j<=n; ++j)

         if(i!=j) road[++m]=Road(i,j,dis[i][j]);

     for(int i=; i<=n; ++i) fa[i]=i;

     std:: sort(road+,road+m+);

     int cnt=,ans=;

     for(int fx,fy,i=; i<=m; ++i)

     {

         fx=find(road[i].u),

         fy=find(road[i].v);

         if(fx==fy) continue;

         fa[fx]=fy; ans+=road[i].w;

         if(++cnt==n) break;

     }

     printf("%d\n",ans);

     return ;

 }

 int Aptal=Presist();

 int main(int argc,char**argv){;}