z-dimension

After a hard training of programming, Little Z decided that he needed a break, so he went on a holiday on the beautiful beaches in the Hawaii. While he was lying under the umbrella, watching the waves constantly arriving at the shore, the wind whispering in his ears, he fell asleep. When he woke up, he noticed that he wasn't anymore on the Hawaii, but he was in some strange room with 4 walls and doors on them. He realised that while he was sleeping, aliens have abducted him, thus transported him to the dimension Z, and put him in a maze of rooms. Little Z must immediately get out of there, and get back to planet Earth. Help him escape, before the aliens return from their coffee break and dissect him.

The maze has rooms and passages between rooms. Rooms are organized as chess fields.There are passages between adjacent horizontal and vertical rooms (but not diagonal rooms).
This is example maze with 3 rows and 4 columns (12 rooms):


Little Z starts from the room marked with 'S' and needs to get to the room marked with 'E'.
Little Z walks uniformly while traveling through the maze, but the time does not pass uniformly in all rooms in dimension Z.So, the time that will pass after Little Z enters the room and before he exits the room is specific for each room.
There are some rooms that can not be visited.
Moving through a horizontal passage takes H minutes and moving through a vertical passage takes V minutes. (All horizontal passages are the same, and all vertical passages are the same).
Find the minimum time Little Z needs to escape from the maze.
If Little Z can not escape, output -1.