#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
#define maxx 300*300
#define RG register 
using namespace std;
struct ed{
	int nxt,to,c,w,f;
}e[maxx];
int tot,head[maxx],n,ans;
void add(int u,int v,int c,int w){e[tot].f=u;
e[tot].nxt=head[u];e[tot].to=v;e[tot].c=c,e[tot].w=w,head[u]=tot++;}
int fa[maxx];
int find(int x){if(fa[x]!=x)fa[x]=find(fa[x]);return fa[x];}
bool comp(const ed & a,const ed & b){return a.w<b.w;}
int main(){
freopen("newstart.in","r",stdin); 	freopen("newstart.out","w",stdout); 
	scanf("%d",&n);
	for(RG int i=0;i<=n;++i)fa[i]=i;
	for(RG int i=1;i<=n;++i){
		int xx;scanf("%d",&xx);
		add(0,i,xx,xx); 
	}
	for(RG int i=1;i<=n;++i)
	 for(RG int j=1;j<=n;++j){
	 	int xx;scanf("%d",&xx);
	 	if(i<j)add(i,j,xx,xx);
	 }
	 sort(e,e+tot,comp);int cnt=0;
	 for(RG int i=0;i<tot,cnt<n;i++){
	 	if(find(e[i].f)!=find(e[i].to))ans+=e[i].w,cnt++,
		 fa[find(e[i].f)]=find(e[i].to);
	 }cout<<ans;return 0;
}