Your problem is NP-hard for $k \geq 3$ by a straight-forward reduction from [3-SET-COVER](http://cstheory.stackexchange.com/questions/20386/restriction-of-exact-cover-by-3-sets). Quick explanation: nodes of $S$ are triplets, nodes of $T$ are set elements and each triplet connected to all elements it contains.