Here's a simple approach:
Ways of selecting pair of 2 students= 4C2 = 6
Ways of distributing 10 prizes among 2 students= 210 = 1024
Total ways till now = 6 * 1024 = 6144 but there are cases that we want to remove like student A getting all the 10 prizes. As A appears in 3 pairs i.e (A,B), (A,C), (A,D). Hence 3 cases for student A. Total such cases for 4 students = 3 * 4= 12
Hence 6144 - 12 = 6132 ways