There's one big inference you need to make: if city X is connected with city Y, then city Y is also connected with city X.
Also, to begin with, what's the maximum amount of connections a city can have? Four.
Other initial inferences: M is given to you -- it can only connect with one city -- therefore, H cannot connect with M because it would force M to connect with a second city (and so you have to note that H cannot "receive" M and M cannot "receive" H). H cannot connect with T (and vice versa) because of the given constraint.
Take a look, then take a break and see if you can come up with the same diagram.

Tell me if you have any questions about this. - Noah