Several sets of prime numbers use each of the eight nonzero digits from 1 to 8 exactly once. What is the smallest possible sum such a set of primes could have?