#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
const int N = 100005;
vector<int> adj[N];
ll h[N];
int n, m;


const ll INF = 1e18;
vector<ll> Dijkstra(int src) {
    vector<ll> dis(n, INF);
    vector<ll> vis(n, false);

    using pll = pair<ll, int>;
    priority_queue<pll, vector<pll>, greater<pll>> pq;

    dis[src] = 0;
    pq.push({0, src});
    while(!pq.empty()) {
        int x = pq.top().second;
        pq.pop();
        if(vis[x]) continue;

        vis[x] = true;
        for(auto v : adj[x]) {
            ll w = (h[v] - h[x]) * (h[v] - h[x]);
            if(dis[v] > dis[x] + w) {
                dis[v] = dis[x] + w;
                pq.push({dis[v], v});
            }
        }
    }
    return dis;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int s, t;
    cin >> n >> m >> s >> t;
    s--, t--;
    for(int i = 0; i < n; i++) {
        cin >> h[i];
    }
    
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    vector<ll> from_src = Dijkstra(s), to_dst = Dijkstra(t);


    ld ans = from_src[t];
    for(int i = 0; i < n; i++) {
        sort(adj[i].begin(), adj[i].end(), [&](int a, int b) {
            return h[a] < h[b];
        });

        for(int j = 0; j < (int)adj[i].size(); j++) {
            for(int k = 0; k < (int)adj[i].size(); k++) {
                if(j == k) continue;
                int v = adj[i][j], u = adj[i][k];

                ans = min(ans, from_src[v] + to_dst[u] + (h[v] - h[u]) * (h[v] - h[u]) / (ld)2.0);
            }
        }
    }

    cout << fixed << setprecision(10) << ans << "\n";
}