#include <iostream>
#include <queue>
#include <cstdio>
#include <cmath>
#define EPS 1e-7
using namespace std;

int main(){
  int n,k,t,u,v,l;
  int a;
  queue<int> q;

  cin >>n>>k>>t>>u>>v>>l;
  while( n-- ){
    cin >> a; q.push( a );
  }

  double time=0.0, now=0.0;
  double disV = v*t;
  int have=0;
  while( now<l ){
    if( have==0 ){
      if( q.empty() ){
	time += (l-now)/(double)u;
	break;
      }else{
	a=q.front(); q.pop(); have++;
	time += (a-now)/(double)u;
	now=a;
      }
    }else{
      have--;
      if( l-now < disV || fabs(l-now-disV)<EPS ){
	time += (l-now)/(double)v;
	break;
      }else{
       double move = t*v;
       while( !q.empty() &&
	   ( now+move>q.front() || fabs(now+move-q.front())<EPS ) ){
	 have++;
	 if( have>k ){
	   move = q.front()-now; q.pop();
	   break;
	 }
	 q.pop();
       }
       now += move;
       time += move/(double)v;
      }
    }
  }
  printf("%.10lf\n",time);

  return 0;
}