Cryptogram, part deux

This one should be a little tricker.

The clue: Every vowel maps to a consonant, and that rule works both ways.

"Pu pw wkpq utku ftzwzjnjc utj xzqw fpwt uz qjwuczo, utjo apcwu hkyj hkq. Ps akru, ftzwzjnjc utj xzqw fpwt uz qjwuczo, utjo apcwu tksq utj jmdpnkbjsu za k wupry fput k apvvpsx adwj ksq 'Krhj Qoskhpuj Rzhgkso' fcpuujs zs utj wpqj. Pu'w hzcj psujcjwupsx, ksq qzjws'u ukyj wz bzsx." --Ujcco Gckurtjuu

Is this too easy? I don't really have a good sense of it.

1. Each letter from A-Z maps to one number. No two letters map to the same number.
2. All vowels, including Y, map to prime numbers. No consonants map to prime numbers.
3. B = 1
4. C x H x U x C x K > 10,000,000
5. What is the lowest possible sum of all 26 of the mapped numbers?