#include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int f[50050],n,m,ans,cnt,w[50050],z;
struct node 
{
    int x,y,w;
}a[200100];
bool cmp(node a,node b)
{
    return a.w<b.w;
}
signed find(int x)
{
    if(f[x]==x)return x;
    else return f[x]=find(f[x]);
}
signed main()
{
	freopen("water.in","r",stdin);
	freopen("water.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
	cin>>w[i];
	a[i].x=n+1,a[i].y=i,a[i].w=w[i];
	}
	z=n;	
	for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    {
    	int c;
    	cin>>c;
       if(i<j&&c!=0)
	   {
	   	z++;
	   	a[z].x=i,a[z].y=j,a[z].w=c;
	   }
    }
    sort(a+1,a+1+z,cmp);
    for(int i=1;i<=n;i++)f[i]=i;
    for(int i=1;i<=z;i++)
    {
        if(find(a[i].x)!=find(a[i].y))
        {
            ans+=a[i].w;
            f[find(a[i].x)]=find(a[i].y);
            cnt++;
            if(cnt==n)
            {
                cout<<ans;
                return 0;
            }
        }
    }
    return 0;
}