Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const (
	MAX_N      = 10000
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix, err := createAdjacentMatrix(n, sc)
	if err != nil {
		panic(err)
	}

	sssp([]int{0}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd(), v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 0
	} else {
		return si.edges[len(si.edges)-1].end
	}
}

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]int, error) {
	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = make([]int, n)
		for j := 0; j < n; j++ {
			adjacentMatrix[id][j] = -1
		}
		vertexNum, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		for j := 0; j < vertexNum; j++ {
			v, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			c, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			adjacentMatrix[id][v] = c
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			if currentShortest.shortest+adj.weight < getShortest(adj.end, shortestList).shortest {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for i, v := range adjacents {
		if v >= 0 {
			edges = append(edges, Edge{start: currentNode, end: i, weight: v})
		}
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include <cassert>
#include <climits>
#include <algorithm>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <queue>
#include <set>

/*
?§????????????¢0??§???????¢????
??????????¢????????????????????????¶????????????????????§???????°????????????§??°?????????????????£???????????????????¢????
while(????????????????????????????????§)
    list = ???????????????.Get????°?????????????????????????
    for(list)
        ?????????????????????
*/

class TVertex;
struct TPath
{
    int Cost;
    TVertex* Target;
    TPath(TVertex* ATarget, int ACost)
     : Target(ATarget), Cost(ACost) {}
    bool operator<(const TPath& Right)const
    {
        if(this->Cost  < 0) return false;
        if(Right.Cost < 0) return true;
        return this->Cost < Right.Cost;
    }
    bool operator>(const TPath& Right)const
    {
        return !((*this) < Right);
    }
};
class TVertex
{
    int FIndex;
    std::priority_queue<TPath, std::vector<TPath>, std::greater<TPath> > FList;
    int FDistance;

public:
    TVertex(int Index)
     : FIndex(Index), FDistance(INT_MAX)
    {}
    void Reserve(int Size)
    {
        // FList.reserve(Size);
    }
    void AddPath(const TPath& Path)
    {
        FList.push(Path);
    }
    void SortPath()
    {
        // std::sort(FList.begin(), FList.end(), Compare);
    }
    void PrintDistance(std::ostream& out)const
    {
        out << FIndex << " " << FDistance << std::endl;
    }
    int GetMinCostPath()const
    {
        if(FList.empty()) return INT_MAX;
        return FList.top().Cost + FDistance;
    }
    void PickupMinCostPath(int MinCost, std::list<TPath>& List)
    {
        while(FList.empty() == false && FList.top().Cost + FDistance == MinCost){
            List.push_back(TPath(FList.top().Target, FList.top().Cost + FDistance));
            FList.pop();
        }
    }
    bool SetDistance(int Distance)
    {
        if(FDistance < Distance) return false;
        FDistance = Distance;
        return true;
    }
};
class TGraph
{
    std::vector<TVertex*> FTable;
    std::set<TVertex*> FShortest;
    void Init(int n)
    {
        assert(n > 0);
        FTable.resize(n);
        for(int i = 0; i < n; ++i){
            FTable[i] = new TVertex(i);
        }
    }
    static bool CompareMinCost(const TVertex* Left, const TVertex* Right)
    {
        return Left->GetMinCostPath() < Right->GetMinCostPath();
    }
    void AddShortest(TVertex* Vertex, int Distance)
    {
        if(Vertex->SetDistance(Distance)){
            FShortest.insert(Vertex);
        }
    }
    std::list<TPath> PickupMinCostPath(int MinCost)
    {
        std::list<TPath> Result;
        for(std::set<TVertex*>::const_iterator It = FShortest.begin();
            It != FShortest.end(); ++It)
        {
            (*It)->PickupMinCostPath(MinCost, Result);
        }
        return Result;
    }
    void SetShortest(const std::list<TPath>& MinCostPathList)
    {
        for(std::list<TPath>::const_iterator It = MinCostPathList.begin();
            It != MinCostPathList.end(); ++It)
        {
            AddShortest(It->Target, It->Cost);
        }
    }
public:
    TGraph(int n)
    {
        Init(n);
    }
    void SetupVertex(std::istream& in)
    {
        int Index;
        in >> Index;
        assert(Index >= 0);
        assert(Index < FTable.size());
        int k;
        in >> k;
        FTable[Index]->Reserve(k);
        for(int i = 0; i < k; ++i){
            int v, c;
            in >> v >> c;
            FTable[Index]->AddPath(TPath(FTable[v], c));
        }
        FTable[Index]->SortPath();
    }
    void SearchShortest()
    {
        FTable[0]->SetDistance(0);
        FShortest.insert(FTable[0]);
        while(FShortest.size() != FTable.size()){
            int MinCost = (*std::min_element(FShortest.begin(), FShortest.end(), CompareMinCost))->GetMinCostPath();
            std::list<TPath> PathList = PickupMinCostPath(MinCost);
            SetShortest(PathList);
        }
    }
    void PrintDistance(std::ostream& out)
    {
        for(int i = 0; i < FTable.size(); ++i){
            FTable[i]->PrintDistance(out);
        }
    }
};

int main()
{
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    int n;
    std::cin >> n;
    TGraph Graph(n);
    for(int i = 0; i < n; ++i){
        Graph.SetupVertex(std::cin);
    }
    Graph.SearchShortest();
    Graph.PrintDistance(std::cout);
    return 0;
    
}