How to use the Huffman code to encode sequences in which there is only one repeated character?

Question

Encryption

How to use the Huffman code to encode sequences in which there is only one character? For example, the message "ahh"? Here, either give each character equal frequencies of occurrence, but this is some kind of nonsense, because it turns out that the same character will be encoded differently in one message, or encoded as 111. Which is correct?