#include<bits/stdc++.h>
using namespace std;
typedef long ll;
typedef array<int,2> pr; 
const int MAXN = 210,INF = 1e8;
void tomin(int& x,int y){x = min(x,y);}
void tomax(int& x,int y){x = max(x,y);}
int T,n,m,s,t,p[MAXN];
vector<int> e[MAXN];
int dis[MAXN][MAXN],tag[MAXN];

int dp[MAXN][MAXN],vis[MAXN][MAXN],ans;

int chk(int x,int y){return x!=s && x!=t && y!=s && y!=t;}

void solve(){
    cin>>n>>m>>s>>t; ans = INF;
    for(int i=1;i<=n;i++)cin>>p[i],e[i].clear();
    for(int i=1,u,v;i<=m;i++)cin>>u>>v,e[u].push_back(v);
    assert(s != t);

    for(int i=1;i<=n;i++){
        int* f = dis[i]; fill(f+1,f+1+n,INF);  fill(tag+1,tag+1+n,0);
        priority_queue<pr> pq; 
        f[i] = p[i],pq.push((pr){-f[i],i});
        while(pq.size()){
            int u = pq.top()[1]; pq.pop(); if(tag[u]++)continue;
            for(auto v : e[u])if(f[v] > f[u]+p[v])f[v] = f[u]+p[v],pq.push((pr){-f[v],v});
        }
    }
    //
    for(int x=1;x<=n;x++)for(int y=1;y<=n;y++)dp[x][y] = INF,vis[x][y] = 0;
    
    //初始化
    tomin(ans,dis[s][t] + dis[t][s] - (p[s] + p[t]));
    for(int x=1;x<=n;x++){
        for(int y=1;y<=n;y++)if(chk(x,y) && x!=y){
            tomin(dp[x][y],dis[x][y]+dis[y][t]+dis[t][x]-(p[x]+p[y]+p[t]));
        }
        if(chk(x,x))dp[x][x] = dis[x][t] + dis[t][x] - (p[x] + p[t]);
    }
    //dijkstra
    while(1){
        int x = -1,y = -1;
        for(int cx=1;cx<=n;cx++)for(int cy=1;cy<=n;cy++)if(!vis[cx][cy] && dp[cx][cy] != INF){
            if(x==-1)x = cx,y = cy; else if(dp[cx][cy] < dp[x][y])x = cx,y = cy;
        }
        if(x==-1)break; 
        if(vis[x][y]++)continue;
        int val = dp[x][y];
        //更新答案
        tomin(ans,val+dis[s][x]+dis[y][s]-(p[x]+p[y]+p[s]));
        //更新其他的dp
        for(int cx=1;cx<=n;cx++)for(int cy=1;cy<=n;cy++)if(chk(cx,cy)){
            if(x==cx || x==cy || y==cx || y==cy)continue;
            tomin(dp[cx][cy],val+dis[cx][cy]+dis[cy][x]+dis[y][cx]-(p[x]+p[y]+p[cx]+p[cy]));
        }
    }
    if(ans == INF)ans = -1;
    cout<<ans<<endl;
}
int main(){
    cin>>T;
    while(T--)solve();

    return 0;
}