MINWALK - Minimum Cost Walk

Here is my code…

Solution link : https://www.codechef.com/viewsolution/28384106
Problem link : https://www.codechef.com/problems/MINWALK

Here i am deleting those edges which are coming more than one…

It is giving SIGSEGV
I know the other approach of min(dis[s]+dis[t]+dis[v]} but can’t find what is wrong with this code.
Help somebody…