Several sets of prime numbers use each of the seven nonzero digits $1,3,4,6,7,8,9$ exactly once. What is the smallest possible sum such a set of primes could have?