Zero XOR paths on Graphs

You are given a weighted undirected graph consisting of $N$ nodes and $M$ edges. Each node has a teleportation cost. That is, let’s say node $v_i$ has a teleportation cost of $c_i$ , then we can reach $v_i$ from any node by paying $c_i$ . From one node we can reach it’s neighbors by paying the cost of weight of the edge that we are using to travel. What is the minimum cost to reach from a node