According to dijkstra's algorithm, we will get shortest path as 6 which is a direct edge from s -> t.
There are only two direct edge from s i.e s -> t with weight 6 and s ->y with weight 7 ,out of which 6 is minimum.
So, it will be selected in the first iteration itself.
Hence, Answer is 6
Note:- But manually if we calculate,we can get the shortest path as 2. So, we can consider this example to show that why dijkstra algorithm fails for the negative weighted edges.