using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
    class Node
    {
        readonly int INFTY = int.MaxValue;

        internal int cost;
        internal bool isVisit;
        internal List<Edge> routes;

        public Node()
        {
            cost = INFTY;
            isVisit = false;
            routes = new List<Edge>();
        }
    }

    class Edge : IComparable
    {
        internal int target;
        internal int cost;

        public Edge(int target, int cost)
        {
            this.target = target;
            this.cost = cost;
        }

        public int CompareTo(object obj)
        {
            Edge temp = obj as Edge;
            return this.cost - temp.cost;
        }
    }

    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());

            Node[] nodeList = new Node[n];

            for (int i = 0; i < n; i++)
            {
                string[] input = Console.ReadLine().Split(' ');
                int u = int.Parse(input[0]);
                int k = int.Parse(input[1]);

                nodeList[u] = new Node();

                for (int j = 0; j < k; j++)
                {
                    int v = int.Parse(input[2 + j * 2]);
                    int c = int.Parse(input[3 + j * 2]);

                    nodeList[u].routes.Add(new Edge(v, c));
                }
            }

            Dijkstra(nodeList, n);
        }

        static void Dijkstra(Node[] nodeList, int n)
        {
            PriorityQueue<Edge> pq = new PriorityQueue<Edge>();

            nodeList[0].cost = 0;
            pq.Enqueue(new Edge(0, 0));

            while (pq.Count() > 0)
            {
                Edge f = pq.Dequeue();
                int u = f.target;
                nodeList[u].isVisit = true;

                if (nodeList[u].cost < -f.cost) continue;

                for (int j = 0; j < nodeList[u].routes.Count; j++)
                {
                    int v = nodeList[u].routes[j].target;

                    if (nodeList[v].isVisit == true) continue;

                    if (nodeList[v].cost > nodeList[u].cost + nodeList[u].routes[j].cost)
                    {
                        nodeList[v].cost = nodeList[u].cost + nodeList[u].routes[j].cost;
                        pq.Enqueue(new Edge(v, -nodeList[v].cost));
                    }
                }
            }

            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < n; i++)
            {
                sb.AppendLine(i + " " + nodeList[i].cost);
            }
            Console.Write(sb);
        }
    }

    class PriorityQueue<T> where T : IComparable
    {
        List<T> heap;
        int size;

        public PriorityQueue()
        {
            heap = new List<T>();
        }

        public void Enqueue(T x)
        {
            heap.Add(x);
            int i = size++;

            while (i > 0)
            {
                int p = (i - 1) / 2;

                if (Compare(heap[p], x) <= 0) break;

                heap[i] = heap[p];
                i = p;
            }
            heap[i] = x;
        }

        public T Dequeue()
        {
            T ret = heap[0];
            T x = heap[--size];

            int i = 0;
            while (i * 2 + 1 < size)
            {
                int a = i * 2 + 1;
                int b = i * 2 + 2;

                if (b < size && Compare(heap[b], heap[a]) < 0)
                    a = b;
                if (Compare(heap[a], x) >= 0)
                    break;

                heap[i] = heap[a];
                i = a;
            }
            heap[i] = x;
            heap.RemoveAt(size);
            return ret;
        }

        public int Count()
        {
            return size;
        }

        private int Compare(T x, T y)
        {
            return y.CompareTo(x);
        }
    }
}

Measured memory_bytes: 37656