#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

int main() {
  int N, K;
  double T, U, V, L;
  double D[204];
  while(cin >> N >> K >> T >> U >> V >> L) {
    for(int i = 0; i < N; ++i) cin >> D[i];
    D[N] = L;

    double res = D[0]/U;
    double remain = T*V;
    double lim = T*V*(K+1);
    for(int i = 0; i < N; ++i) {
      double dist = D[i+1] - D[i];
      if(dist <= remain) {
	res += dist/V;
	remain -= dist;
      } else {
	res += remain/V + (dist-remain)/U;
	remain = 0;
      }
      remain = min(remain+T*V, lim);
    }
    printf("%.9f\n", res);
  }
}