Find all prime numbers $p$ and $q$ such that
$$1 + \frac{p^q - q^p}{p + q}$$
is a prime number.

[i]Proposed by Dorlir Ahmeti, Albania[/i]
We need to find all prime numbers \( p \) and \( q \) such that 
\[ 1 + \frac{p^q - q^p}{p + q} \]
is a prime number.

1. Start by rewriting the given expression:
   \[ 1 + \frac{p^q - q^p}{p + q} = r \]
   where \( r \) is a prime number. This implies:
   \[ p^q - q^p + p + q = r(p + q) \]

2. Consider the equation modulo \( p \):
   \[ p^q - q^p + p + q \equiv 0 \pmod{p} \]
   Since \( p^q \equiv 0 \pmod{p} \) and \( p \equiv 0 \pmod{p} \), we have:
   \[ -q^p + q \equiv 0 \pmod{p} \]
   \[ q(q^{p-1} - 1) \equiv 0 \pmod{p} \]

3. Since \( q \) is a prime and \( p \neq q \), \( q \) cannot be divisible by \( p \). Therefore:
   \[ q^{p-1} \equiv 1 \pmod{p} \]
   This follows from Fermat's Little Theorem, which states that for any integer \( a \) and a prime \( p \):
   \[ a^{p-1} \equiv 1 \pmod{p} \]

4. Now consider the equation modulo \( q \):
   \[ p^q - q^p + p + q \equiv 0 \pmod{q} \]
   Since \( q^p \equiv 0 \pmod{q} \) and \( q \equiv 0 \pmod{q} \), we have:
   \[ p^q + p \equiv 0 \pmod{q} \]
   \[ p(p^{q-1} + 1) \equiv 0 \pmod{q} \]

5. Since \( p \) is a prime and \( p \neq q \), \( p \) cannot be divisible by \( q \). Therefore:
   \[ p^{q-1} \equiv -1 \pmod{q} \]

6. Suppose \( p = 2 \). Then the equation becomes:
   \[ 2^q - q^2 + q + 2 = r(2 + q) \]
   Simplifying, we get:
   \[ 2^q - q^2 + q + 2 = 2r + rq \]

7. For \( q = 3 \):
   \[ 2^3 - 3^2 + 3 + 2 = 8 - 9 + 3 + 2 = 4 \]
   \[ 2r + 3r = 5r \]
   Since 4 is not a multiple of 5, \( q = 3 \) does not work.

8. For \( q = 5 \):
   \[ 2^5 - 5^2 + 5 + 2 = 32 - 25 + 5 + 2 = 14 \]
   \[ 2r + 5r = 7r \]
   Since 14 is a multiple of 7, \( r = 2 \), which is a prime number.

Therefore, the only solution is \( (p, q) = (2, 5) \).

The final answer is \(\boxed{(2, 5)}\).