//#include #include #include #include #include #include #include #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower using namespace std; //using namespace atcoder; using ll = long long; #define all(A) A.begin(),A.end() using vll = vector; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) using Graph = vector>>; vector> Z; double dist(ll A,ll B){ ll dx=Z[A].first-Z[B].first; ll dy=Z[A].second-Z[B].second; return sqrt(dx*dx+dy*dy); } int main() { ll N,M,X,Y; cin >> N>>M>>X>>Y; X--;Y--; Graph G(N); Z.resize(N); rep(i,N){ ll P,Q; cin>>P>>Q; Z[i]=make_pair(P,Q); } rep(m,M){ ll P,Q; cin>>P>>Q; P--;Q--; G[P].push_back(make_pair(Q,dist(P,Q))); G[Q].push_back(make_pair(P,dist(P,Q))); } priority_queue,vector>,greater>> que; vector D(N,1e18); que.push(make_pair(double(0),X)); D[X]=0; while(!que.empty()){ auto p=que.top(); que.pop(); ll v=p.second; for(auto next:G[v]){ ll nv=next.first; double d=next.second; if(D[nv]