#include<bits/stdc++.h>
using namespace std;
typedef long ll;
typedef array<int,2> pr;  typedef array<int,4> qr;
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],tmp[MAXN][MAXN],vis[MAXN][MAXN],visg[MAXN][MAXN],ans;

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

priority_queue<qr> pq;

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});
        }
    }
    if(dis[s][t] == INF || dis[t][s] == INF)return void(cout<<"-1\n");
    //
    for(int x=1;x<=n;x++)for(int y=1;y<=n;y++)dp[x][y] = INF,vis[x][y] = 0;
    for(int x=1;x<=n;x++)for(int y=1;y<=n;y++)tmp[x][y] = INF,visg[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]);
    }
    for(int x=1;x<=n;x++)for(int y=1;y<=n;y++)if(dp[x][y] != INF)pq.push((qr){-dp[x][y],1,x,y});
    //dijkstra
    while(pq.size()){
        int vx = -1,vy = -1,wx = -1,wy = -1;
        qr top = pq.top(); pq.pop();
        if(top[1] == 1)vx = top[2],vy = top[3];else wx = top[2],wy = top[3];
        //
        if(vx==-1 && wx==-1)break;
        if(wx==-1 || (vx!=-1 && dp[vx][vy] < tmp[wx][wy])){
            int x = vx,y = vy,val = dp[x][y];
            if(vis[x][y]++)continue;
            tomin(ans,val+dis[s][x]+dis[y][s]-(p[x]+p[y]+p[s]));
            //
            for(int cx=1;cx<=n;cx++)if(chk(cx,y) && y!=cx){
                int w =val+dis[y][cx]-p[y]-p[cx];
                if(tmp[x][cx] > w){
                    tmp[x][cx] = w;
                    pq.push((qr){-w,2,x,cx});
                }
            }
        }else{
            int x = wx,cx = wy,val = tmp[x][cx];
            if(visg[x][cx]++)continue;
            for(int cy=1;cy<=n;cy++)if(chk(cx,cy) && x!=cy){
                int w = val+dis[cy][x]-p[x]-p[cy]+dis[cx][cy];
                if(dp[cx][cy] > w){
                    dp[cx][cy] = w;
                    pq.push((qr){-w,1,cx,cy});
                }
            }
        }
    }
    cout<<ans<<endl;
}
int main(){
    cin>>T;
    while(T--)solve();

    return 0;
}