#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cctype>

 #include<queue>

 #define re register

 using namespace std;

 void read(int &x){

     char c=getchar();x=;

     while(!isdigit(c)) c=getchar();

     while(isdigit(c)) x=(x<<)+(x<<)+(c^),c=getchar();

 }

 struct data{

     int d,u;

     data(){}

     data(int A,int B):

         d(A),u(B)

     {}

     bool operator < (const data &tmp) const{return d>tmp.d;}

 };priority_queue <data> h;

 #define N 305

 int n,a[N][N],d[N],ans; bool vis[N];

 int main(){

     read(n);++n; int k=;

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

         read(a[n][i]),a[i][n]=a[n][i];//新建边

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

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

             read(a[i][j]);

     memset(d,,sizeof(d));

     h.push(data(d[]=,));

     while(!h.empty()&&k<n){

         data x=h.top(); h.pop();

         if(vis[x.u]) continue;

         vis[x.u]=; ++k; ans+=x.d;

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

             if(a[x.u][i]){

                 if(d[i]>a[x.u][i]){

                     d[i]=a[x.u][i];

                     h.push(data(a[x.u][i],i));

                 }

             }

     }printf("%d",ans);

     return ;

 }