class PriorityQueue
  def initialize
    @values = [nil]
    @pos = 0
  end

  def push(value)
    @pos += 1
    @values[@pos] = value

    i = @pos

    while 2 <= i && @values[i] < @values[i / 2]
      @values[i], @values[i / 2] = @values[i / 2], @values[i]
      i /= 2
    end
  end

  def pop
    return nil if empty?

    ret = @values[1]
    @values[1] = @values[@pos]
    @pos -= 1

    i = 1

    loop do
      l = i * 2
      r = l + 1

      smallest = l <= @pos && @values[l] < @values[i] ? l : i
      smallest = r <= @pos && @values[r] < @values[smallest] ? r : smallest

      break if smallest == i

      @values[i], @values[smallest] = @values[smallest], @values[i]

      i = smallest
    end

    ret
  end

  def empty?
    @pos <= 0
  end
end

class Node
  include Comparable

  attr_reader :id, :siblings
  attr_accessor :state, :total

  def initialize(id)
    @id = id
    @siblings = []
    @distances = {}
    @state = :white
    @total = 0
  end

  def <=>(other)
    @total <=> other.total
  end

  def add(sibling, distance)
    @siblings << sibling
    @distances[sibling.id] = distance
  end

  def distance_to(sibling)
    @distances[sibling.id]
  end
end

if $PROGRAM_NAME == __FILE__
  n = gets.to_i

  nodes = []

  n.times do
    id, _, *rest = gets.chomp.split.map(&:to_i)

    nodes[id] ||= Node.new(id)
    node = nodes[id]

    rest.each_slice(2) do |sibling_id, distance|
      nodes[sibling_id] ||= Node.new(sibling_id)
      sibling = nodes[sibling_id]
      node.add(sibling, distance)
    end
  end

  distances = Array.new(n, Float::INFINITY)

  distances[0] = 0
  nodes[0].state = :gray

  queue = PriorityQueue.new
  queue.push(nodes[0])

  until queue.empty?
    current = queue.pop
    current.state = :black

    next if distances[current.id] < current.total

    current.siblings.each do |sibling|
      next if sibling.state == :black

      distance = distances[current.id] + current.distance_to(sibling)

      if distance < distances[sibling.id]
        distances[sibling.id] = distance
        sibling.total = distance
        sibling.state = :gray
        queue.push(sibling)
      end
    end
  end

  puts distances.map.with_index {|distance, id| [id, distance].join(' ') }.join("\n")
end