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{1}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Printf("%d %d\n", v.getEnd()-1, v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 1
	} 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-1]
}

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-1] = shortestInfo
}

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

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

C++: #include <iostream>
#include <vector>
#include <queue>
using namespace std;
static const int MAX=10000;
static const int INFTY=(1<<21);
static const int WHITE=0;
static const int GRAY=1;
static const int BLACK=2;
int n;
vector<pair<int, int> > adj[MAX];
void dijkstra(){
    priority_queue<pair<int, int> > PQ;
    int color[MAX];
    int d[MAX];
    for(int i=0; i<n; i++){d[i]=INFTY; color[i]=WHITE;}
    d[0]=0;
    PQ.push(make_pair(0, 0));
    color[0]=GRAY;
    while(!PQ.empty()){
        pair<int,int> f=PQ.top(); PQ.pop();
        int u=f.second;
        color[u]=BLACK;
        if(d[u]<f.first*(-1)) continue;
        for(int j=0; j<adj[u].size(); j++){
            int v=adj[u][j].first;
            if(color[v]==BLACK)continue;
            if(d[v]>d[u]+adj[u][j].second){
                d[v]=d[u]+adj[u][j].second;
                PQ.push(make_pair(d[v]*(-1),v));
                color[v]=GRAY;
            }
        }
    }
    for(int i=0; i<n; i++) cout<<i<<" "<<(d[i]==INFTY ? -1:d[i])<<endl;
}

int main(){
    int k,u,v,c;
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>u>>k;
        for(int j=0; j<k; j++){
            cin>>v>>c;
            adj[u].push_back(make_pair(v, c));
        }
    }
    dijkstra();
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
#define N 10000
#define WHITE 0
#define GRAY 1
#define BLACK 2
static const int INFTY = (1<<20);
int n;
vector<pair<int,int> >adj[N];
void dijkstra(void);
int main()
{
  int i,j,k;
  int u, v, c;

  cin >> n;

  for(i = 0;i < n;i++)
  {
    cin >> u >> k;

    for(j = 0;j < k;j++)
    {
      cin >> v >> c;

      adj[u].push_back(make_pair(v, c));
    }
  }

  dijkstra();

  return 0;
}




void dijkstra()
{
  priority_queue<pair<int,int> >PQ;
  int i,j;
  int u,v;
  int d[N],color[N];

  for(i = 0;i < n;i++)
  {
    color[i] = WHITE;
    d[i] = INFTY;
  }

  color[0] = GRAY;
  d[0] = 0;
  PQ.push(make_pair(0,0));

  while(!PQ.empty())
  {
    pair<int,int>a = PQ.top();
    PQ.pop();

    u = a.second;
    color[u] = BLACK;

        if(d[u] < a.first*(-1))
        {
          continue;
        }

        for(j = 0;j < adj[u].size();j++)
        {
          v = adj[u][j].first;

          if(color[v] == BLACK)
          {
    	       continue;
          }

          if(d[v] > d[u] + adj[u][j].second)
          {
    	       color[v] = GRAY;
    	       d[v] = d[u] + adj[u][j].second;
    	       PQ.push(make_pair(d[v]*(-1),v));
          }
        }

      }

      for(i = 0;i < n;i++)
      {
        cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl;
      }
    }

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(ll i=0;i<N;++i)
typedef long long int ll;
ll INF = 900010;
static const int white = 0;
static const int gray = 1;
static const int black = 2;
using P = pair<int ,int>;

ll N;
vector<vector<P> > G(10010);

void dijkstra(){
    priority_queue<P, vector<P> , greater<P> > pq;
    vector<int> color(N,white);
    vector<int> d(N,INF);
    d[0] = 0;
    pq.push(make_pair(0,0));
    color[0] = gray;

    while(!pq.empty()){
        P f = pq.top(); pq.pop();
        int u = f.second;
        color[u] = black;

        if(d[u] > f.first ) continue;

        for(auto e : G[u]){
            int v = e.first;
            if( color[v] == black ) continue;
            if(d[v] > d[u] + e.second ){
                d[v] = d[u] + e.second;
                pq.push(make_pair(d[v], v));
                color[v] = gray;
            }
        }
    }

    rep(i,N){
        cout << i << " " << (d[i] == INF ? -1 : d[i] ) << endl;
    }
}

int main(){
    cin >> N;
    rep(j,N){
        ll u,k; cin >> u >> k;
        rep(i,k){
            ll v,c; cin >> v >> c;
            G[u].push_back(make_pair(v,c));
        }
    }

    dijkstra();
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define WHITE 0
#define VISITED 1
#define CANDIDATE 2

void dks(vvpii &g, vi &d, vi &s) {
  priority_queue<pii, vpii, greater<pii>> q;
  q.push(make_pair(d[0], 0));

  while (!q.empty()) {
    auto qt = q.top(); q.pop();
    int u = qt.second, c = qt.first;
    s[u] = VISITED;

    if (d[u] < c) continue;
    
    for (auto cp: g[u]) {
      int v = cp.first, t = d[u] + cp.second;
      if (s[v] != VISITED && t < d[v]) {
        d[v] = t;
        s[v] = CANDIDATE;
        q.push(make_pair(d[v], v)); 
      }
    }
  }
}

int main() {
  int n;
  cin >> n;
  
  vvpii g(n);
  rep(_, n) {
    int u, k;
    cin >> u >> k;

    rep(__, k) {
      int v, c;
      cin >> v >> c;

      g[u].push_back(make_pair(v, c));
    }
  }
  
  vi d(n, 1 << 21), s(n, WHITE);
  d[0] = 0;
  dks(g, d, s);

  rep(i, n) printf("%d %d\n", i, d[i]);
}