#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>

using namespace std;

typedef long double ld;
typedef long long ll;
const int MAX = 100010;
bool cal[MAX];
ll N,K,T,U,V,L;

void input(){
  cin >> N >> K >> T >> U >> V >> L;
  for(int i = 0; i < N; i++){
    int pos;
    cin >> pos;
    cal[pos] = true;
  }
}

void solve(){
  ld ans = 0;
  ll boost = 0;

  for(int i = 0; i < L; i++){
    if(cal[i]) boost = min((K+1)*T*V,boost+T*V); 
    //cout << boost << endl;
    if(boost > 0){
      boost--;
      ans += 1.0/(ld)V;
    }else{
      ans += 1.0/(ld)U;
    }
 
  }
  printf("%.8Lf\n",ans);
}

int main(){
  input();
  solve();
  return 0;
}