# encoding: utf-8

class UFSet
  def initialize(sz)
    @sz = sz
    @par = [0] * sz
    (0..sz - 1).each { |idx| @par[idx] = idx}
  end

  def find(x)
    if @par[x] == x
      x
    else
      @par[x] = find(@par[x])
    end
  end

  def same(x, y)
    find(x) == find(y)
  end

  def unite(x, y)
    fx = find(x)
    fy = find(y)
    @par[fx] = fy if fx != fy
  end
end

class Graph
  def initialize(v)
    @v = v
    @edge = []
    @g = []
    (0..@v - 1).each { @g << Array.new}
    @dist = [0x3fffffff] * v
    @prev = [-1] * v
  end

  def add_edge(u, v, w)
    @edge << { from: u, to: v, weight: w}
    @g[u] << { to: v, weight: w}
  end

  def mst_kruskal
    ans = 0
    @edge = @edge.sort_by { |x| x[:weight]}
    ufset = UFSet.new(@v)
    @edge.each do |ee|
      u, v, c = ee[:from], ee[:to], ee[:weight]
      if not ufset.same(u, v)
        ans += c
        ufset.unite(u, v)
      else
        next
      end
    end
    ans
  end

  def dijkstra(s)
    @dist[s] = 0
    que = { }
    que[s] = 0

    while not que.empty?
      v, d = que.min_by { |key, val| val}
      que.delete_if { |key, val| key == v and val == d}
      next if (@dist[v] < d)
      @g[v].each do |node|
        to, weight = node[:to], node[:weight]
        if @dist[to] > @dist[v] + weight
          @prev[to] = v
          @dist[to] = @dist[v] + weight
          que[to] = @dist[to]
        end
      end
    end

    (0..@v - 1).each do |i|
      puts "#{i} #{@dist[i]}"
    end
  end
end

def main
  n = gets.rstrip.to_i
  g = Graph.new(n)
  (0..n - 1).each do |row|
    info = gets.rstrip.split(/\s/).map(&:to_i)
    idx, kk = info[0], info[1]
    edges = info[2..-1]
    (0..kk - 1).each do |k|
      v, c = edges[2 * k], edges[2 * k + 1]
      g.add_edge(row, v, c)
    end
  end
  g.dijkstra(0)
end

main