#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
#define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
// const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 1e6 + 15;
ll dp[maxN];
bool bad[maxN];
void solve() {
int n, q, d, a, b;
cin >> n >> q >> d >> a >> b;
int l[n + 1], r[n + 1], x[q + 1];
for (int i = 1; i <= n; i++)
cin >> l[i] >> r[i];
for (int i = 1; i <= q; i++) cin >> x[i];
for (int i = 1; i <= n; i++)
for (int j = l[i]; j <= r[i]; j++) bad[j] = 1;
for (int i = 0; i < maxN; i++) dp[i] = biginf;
dp[0] = 0;
for (int i = 1; i <= 1000000; i++) {
if (bad[i]) continue;
if (!bad[i - 1]) dp[i] = min(dp[i], dp[i - 1] + a);
if (i - d >= 0 && !bad[i - d]) dp[i] = min(dp[i], dp[i - d] + b);
}
for (int i = 1; i <= q; i++) {
if (dp[x[i]] >= biginf) {
cout << "-1\n"; continue;
} cout << dp[x[i]] << '\n';
}
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
