Non exhaustive patterns in haskell recursion

Question

I\'m trying to write a function which gives me the distance between every district in my list. The function distance gives me the distance between two districts as an Int fr