Unique Games Conjecture

For every $\varepsilon,\delta>0$, does there exist an alphabet size $q$ such that it is NP-hard to distinguish Unique Games instances with optimum at least $1-\varepsilon$ from those with optimum at most $\delta$?