#include <bits/stdc++.h>
using namespace std;
int n,k,m,s,t;
int c[105];
int a[105][105];
int mp[105][105];
int f[105][105];
int main(){
    // freopen("test.in","r",stdin);
    // freopen("test.out","w",stdout);
    memset(mp,0x3f3f3f3f,sizeof(mp));
    memset(f,0x3f3f3f3f,sizeof(f));
    scanf("%d%d%d%d%d",&n,&k,&m,&s,&t);
    for (int i=1;i<=n;i++){
        scanf("%d",&c[i]);
    }
    for (int i=1;i<=k;i++){
        for (int j=1;j<=k;j++){
            scanf("%d",&a[i][j]);
        }
    }
    for (int i=1;i<=m;i++){
        int u,v,w;
        cin>>u>>v>>w;
        mp[u][v]=min(mp[u][v],w);
        mp[v][u]=min(mp[v][u],w);
        f[u][v]=min(f[u][v],w);
        f[v][u]=min(f[v][u],w);
    }
    for (int i=1;i<=100;i++){
        mp[i][i]=0;
        f[i][i]=0;
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            for (int k=1;k<=n;k++){
                f[j][k]=min(f[j][k],f[j][i]+f[i][k]);
            }
        }
    }
    // int maxn=0;
    // for (int i=1;i<=n;i++){
    //     for (int j=1;j<=n;j++){
    //         maxn=max(maxn,f[i][j]);
    //     }
    // }
    // cout<<maxn<<endl;
    int ts=f[min(s,t)][max(s,t)];
    int sd=0;
    while (ts!=0){
        sd=ts%10;
        ts/=10;
    }
    // if (sd==8 or sd==1) cout<<-1<<endl;
    if (sd==1) cout<<f[min(s,t)][max(s,t)]<<endl;
    else if (sd==8 or sd==1) cout<<-1<<endl;
    else if (c[min(s,t)]==c[max(s,t)]) cout<<-1<<endl;
    else cout<<f[min(s,t)][max(s,t)]<<endl;
    return 0;
}