ソースコード
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
long long int power(long long int x, long long int n, long long int M) {
long long int tmp = 1;
if (n > 0) {
tmp = power(x, n / 2, M);
if (n % 2 == 0) tmp = (tmp*tmp) % M;
else tmp = (((tmp*tmp) % M)*x) % M;
}
return tmp;
}
long long int N, M, K, Q, W, H, L, R;
long long int ans;
int main() {
ios::sync_with_stdio(false);
long long int S;
cin >> N >> M >> K >> S;
cin >> L >> R;
int dead[100001] = {};
list<int>edge[100001] = {};
long long int dis[100001] = {};
for (int i = 0; i <= N; i++)dis[i] = LLONG_MAX;
dis[0] = 0;
dead[0] = 2;
for (int i = 0; i < K; i++) {
int a;
cin >> a;
dead[a] = 2;
edge[0].push_back(a);
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
if (dead[b] != 2)edge[a].push_back(b);
if (dead[a] != 2)edge[b].push_back(a);
}
queue<int>Q;
Q.push(0);
while (!Q.empty()) {
int c = Q.front();
for (auto i : edge[c]) {
if (dis[c] + 1 < dis[i]) {
Q.push(i);
dis[i] = dis[c] + 1;
}
}
Q.pop();
}
for (int i = 1; i <= N; i++) {
if (dis[i] <= S + 1 && dis[i] >= 2)dead[i] = 1;
dis[i] = LLONG_MAX;
// cout << i << " " << dead[i] << endl;
}
priority_queue<pair<long long int, int>, vector<pair<long long int, int> >, greater<pair<long long int, int> > >PQ;
PQ.push({ 0, 1 });
while (!PQ.empty()) {
int c = PQ.top().second;
if (dis[c] != LLONG_MAX) {
PQ.pop();
continue;
}
dis[c] = PQ.top().first;
// cout << c << " " << dis[c] << endl;
PQ.pop();
for (auto i : edge[c]) {
if (dead[i] == 1) {
if (dis[c] < dis[i] - R) {
PQ.push({ dis[c] + R, i });
}
}
else {
if (dis[c] < dis[i] - L) {
PQ.push({ dis[c] + L,i });
}
}
}
}
if (dead[N])dis[N] -= R;
else dis[N] -= L;
cout << dis[N] << endl;
return 0;
}