using System.Collections.Generic;
using System;

public class PriorityQueue<T> where T : IComparable
{
    private IComparer<T> _comparer = null;
    private int _type = 0;
    private T[] _heap;
    private int _sz = 0;
    private int _count = 0;
    public PriorityQueue(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _type = type;
    }
    private int Compare(T x, T y)
    {
        if (_comparer != null) return _comparer.Compare(x, y);
        return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
    }
    public void Push(T x)
    {
        _count++;
        var i = _sz++;
        while (i > 0)
        {
            var p = (i - 1) / 2;
            if (Compare(_heap[p], x) <= 0) break;
            _heap[i] = _heap[p];
            i = p;
        }
        _heap[i] = x;
    }
    public T Pop()
    {
        _count--;
        T ret = _heap[0];
        T x = _heap[--_sz];
        int i = 0;
        while (i * 2 + 1 < _sz)
        {
            int a = i * 2 + 1;
            int b = i * 2 + 2;
            if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;
            if (Compare(_heap[a], x) >= 0) break;
            _heap[i] = _heap[a];
            i = a;
        }
        _heap[i] = x;
        return ret;
    }
    public int Count() => _count;
    public T Peek() => _heap[0];
    public bool Contains(T x)
    {
        for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
        return false;
    }
    public void Clear()
    {
        while (this.Count() > 0) this.Pop();
    }
    public IEnumerator<T> GetEnumerator()
    {
        var ret = new List<T>();
        while (this.Count() > 0)
        {
            ret.Add(this.Pop());
        }
        foreach (var r in ret)
        {
            this.Push(r);
            yield return r;
        }
    }
    public T[] ToArray()
    {
        T[] array = new T[_sz];
        int i = 0;
        foreach (var r in this)
        {
            array[i++] = r;
        }
        return array;
    }
}

public class hello
{
    public static int n, k, t, U, V, L;
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        n = int.Parse(line[0]);
        k = int.Parse(line[1]);
        t = int.Parse(line[2]);
        U = int.Parse(line[3]);
        V = int.Parse(line[4]);
        L = int.Parse(line[5]);
        var c = new bool[L];
        getAns();
    }
    static void getAns()
    {
        var c = new bool[L];
        var pq = new PriorityQueue<int>(L * 2, 0);
        for (int i = 0; i < n; i++)
        {
            var x = int.Parse(Console.ReadLine().Trim());
            pq.Push(x);
            c[x] = true;
        }
        var vup = false;
        var time = 0d;
        var take = 0;
        var vdown = 0;
        var preL = 0;
        while (pq.Count() > 0)
        {
            var i = pq.Pop();

            if (pq.Count() > 0 && pq.Peek() == i) pq.Pop();
            if (i >= L) continue;
            if (vdown == i)
            {
                if (take > 0) { take--; vdown = i + t * V; pq.Push(vdown); }
                else
                {
                    vup = false;
                    time += (double)(i - preL) / V;
                    preL = i;
                }
            }
            if (c[i])
            {
                if (!vup)
                {
                    vup = true;
                    vdown = i + t * V;
                    pq.Push(vdown);
                    time += (double)(i - preL) / U; preL = i;
                }
                else
                {
                    if (take == k)
                    {
                        vdown = i + t * V;
                        pq.Push(vdown);
                        time += (double)(i - preL) / V;
                        preL = i;
                    }
                    else take++;
                }
            }
        }
        if (vup) time += (double)(L - preL) / V;
        else time += (double)(L - preL) / U;
        Console.WriteLine(time);
    }
}



Measured memory_bytes: 18016