#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll n, k, t, u, v, l; scanf("%lld %lld %lld %lld %lld %lld", &n, &k, &t, &u, &v, &l);
	vector<ll> d(n); for (int i = 0; i < n; i++) scanf("%lld", &d[i]);
	double curx = 0;
	double curt = 0;
	int curc = 0;
	int right = 0;
	d.push_back(l);
	n += 1;
	while (curx + 1e-14 < l) {
		if (curc == 0) {
			curt += (double)(d[right] - curx) / u;
			curx = d[right];
			curc = 1;
			right++;
		}
		else {
			curc -= 1;
			double nx = curx + v * t;
			chmin(nx, (double)l);
			while (right < n and d[right] <= nx) {
				curc++;
				if (curc > k) {
					nx = d[right] + v * t;
					chmin(nx, (double)l);
					curc = k;
				}
				right++;
			}
			curt += (double)(nx - curx) / v;
			curx = nx;
		}
	}
	cout << fixed << setprecision(12) << curt << endl;
	return 0;
}

