#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
const int inf=0x7fffffff;
struct did{
	int to,nxt,val;
}edge[100005*2];
int cnt;int head[100005*2];
int n,k,m,s,t;
int c[10005];
int a[10005][10005];
int dis[100005];
int wh[100005];
int sr[1005][1005]; 
struct dd{
	int u,dis;
	bool operator<(const dd&t)const
	{
		return t.dis<dis;
	}
};
void add(int u,int v,int w)
{
	cnt++;
	edge[cnt].to=v;
	edge[cnt].val=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt;
}

void dijkstra()
{
	priority_queue<dd>q;
	for(int i=1;i<=n;i++)dis[i]=inf;
	dis[s]=0;
	wh[c[s]]=1;
	q.push((dd){s,0});
	while(!q.empty())
	{
		dd tmp=q.top();
		q.pop();
		int u=tmp.u;
		int d=tmp.dis;
		if(d!=dis[u])continue;
		for(int i=head[u];i;i=edge[i].nxt)
		{
			int v=edge[i].to;
			int w=edge[i].val;
			if(dis[u]+w<dis[v])
			{
				int can=1;
				for(int kk=1;kk<=k;kk++)
				{
					if(a[v][kk]&&wh[kk])
					{
						can=0;
						break;
					}
				}
				if(can)
				{
					wh[c[v]]=1;
					dis[v]=dis[u]+w;
					q.push((dd){v,dis[v]});
				}
			}
		}
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin>>n>>k>>m>>s>>t;
	for(int i=1;i<=n;i++)
	{
		cin>>c[i];
	}
	for(int i=1;i<=k;i++)
	{
		for(int j=1;j<=k;j++)
		{
			cin>>a[i][j];
		}
	}
	memset(sr,0,sizeof(sr));
	for(int i=1;i<=m;i++)
	{
		int u,v,d;
		cin>>u>>v>>d;	
		if(sr[u][v]&&sr[v][u]&&d>sr[u][v])continue;
		else
		{
			add(u,v,d);
			add(v,u,d);
			sr[u][v]=sr[v][u]=d;	
		}
	} 
	if(c[s]==c[t])//
	{
		cout<<-1<<endl;
		return 0;
	}
	dijkstra();
	
	if(dis[t]!=inf)cout<<dis[t]<<endl;
	else cout<<-1<<endl;
	return 0;
}