This is a monoalphabetic substitution cipher - the same letter in the plaintext will always be represented as a identical letter in the ciphertext (for example the plaintext-letter "E" is always a "V" in the ciphertext).
Frequency analysis works better the longer the text is. For very short texts (as yours) it can be very difficult to have an exact representation of the frequency analysis. If the most occuring letter is not "E", then you can move on to the second-most common letter (which would be the letter "T")
Other / similar techniques:
Double-letter-words: Another technique you could try is to find all the words that have repeating letters, for your example that would be the last word "cheers". I think that in the English language the most common double-letter-words have 2 "L" in them, like "kill". But again this would fail, since here the double-letter-word is "cheers".
Word-frequency-analysis: You can also do a frequency analysis for whole words instead of single letters. Again, for the English language, this would be the word "the". For a long text you would expect that the word "the" would show up most often.
As you can see most of these common techniques would fail for your cipher-text. So the best technique you can use is brute-force.