using System.Linq;
using System.Collections.Generic;
using System;
using System.Runtime.InteropServices;

public class PriorityQueue<T> where T : IComparable
{
    private IComparer<T> _comparer = null;
    private int _type = 0;
    private T[] _heap;
    private int _sz = 0;
    private int _count = 0;
    /// <summary>
    /// Priority Queue with custom comparer
    /// </summary>
    public PriorityQueue(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }

    /// <summary>
    /// Priority queue
    /// </summary>
    /// <param name="maxSize">max size</param>
    /// <param name="type">0: asc, 1:desc</param>
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _type = type;
    }
    private int Compare(T x, T y)
    {
        if (_comparer != null) return _comparer.Compare(x, y);
        return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
    }
    public void Push(T x)
    {
        _count++;
        //node number
        var i = _sz++;
        while (i > 0)
        {
            //parent node number
            var p = (i - 1) / 2;

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

            _heap[i] = _heap[p];
            i = p;
        }
        _heap[i] = x;
    }
    public T Pop()
    {
        _count--;
        T ret = _heap[0];
        T x = _heap[--_sz];

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

            if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

            if (Compare(_heap[a], x) >= 0) break;

            _heap[i] = _heap[a];
            i = a;
        }
        _heap[i] = x;
        return ret;
    }
    public int Count()
    {
        return _count;
    }
    public T Peek()
    {
        return _heap[0];
    }
    public bool Contains(T x)
    {
        for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
        return false;
    }
    public void Clear()
    {
        while (this.Count() > 0) this.Pop();
    }
    public IEnumerator<T> GetEnumerator()
    {
        var ret = new List<T>();
        while (this.Count() > 0)
        {
            ret.Add(this.Pop());
        }
        foreach (var r in ret)
        {
            this.Push(r);
            yield return r;
        }
    }
    public T[] ToArray()
    {
        T[] array = new T[_sz];
        int i = 0;
        foreach (var r in this)
        {
            array[i++] = r;
        }
        return array;
    }
}
public class Edge
{
    public int to { get; set; }
    public long d { get; set; }
}
public class Node : IComparable
{
    public int id { get; set; }
    public long d { get; set; }
    public int CompareTo(object obj)
    {
        var x = (Node)obj;
        if (this.d > x.d) return 1;
        else if (this.d == x.d) return 0;
        else return -1;
    }
}

public class P
{
    public int to { get; set; }
    public int from { get; set; }
    public int time { get; set; }
}

public class hello
{
    public static long BIG = 9999999999999;
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var n = int.Parse(line[0]);
        var e = int.Parse(line[1]);
        var c = new int[n];
        var r = new int[n];
        var ta = new List<int>[n];
        for (int i = 0; i < n; i++)
        {
            line = Console.ReadLine().Trim().Split(' ');
            c[i] = int.Parse(line[0]);
            r[i] = int.Parse(line[1]);
            ta[i] = new List<int>();
        }
        for (int i = 0; i < e; i++)
        {
            line = Console.ReadLine().Trim().Split(' ');
            var s = int.Parse(line[0]) - 1;
            var t = int.Parse(line[1]) - 1;
            ta[s].Add(t);
            ta[t].Add(s);
        }
        var a = makeEdge(n, c, r, ta);

        var mind = new long[n];
        for (int i = 0; i < n; i++) mind[i] = BIG;
        goDijk(a, 0, n, mind);
        Console.WriteLine(mind[n - 1]);
    }
    static List<Edge>[] makeEdge(int n, int[] c, int[] r, List<int>[] ta)
    {
        var a = new List<Edge>[n];
        for (int i = 0; i < n; i++) a[i] = new List<Edge>();
        for (int i = 0; i < n; i++)
        {
            var q = new Queue<P>();
            var visited = new bool[n];
            visited[i] = true;
            foreach (var x in ta[i])
            {
                q.Enqueue(new P { to = x, from = i, time = 1 });
                visited[x] = true;
                a[i].Add(new Edge { to = x, d = c[i] });
            }
            while (q.Count() > 0)
            {
                var w = q.Dequeue();
                if (w.time == r[w.from]) continue;
                foreach (var x in ta[w.to])
                {
                    if (!visited[x])
                    {
                        q.Enqueue(new P { to = x, from = w.from, time = w.time + 1 });
                        visited[x] = true;
                        a[w.from].Add(new Edge { to = x, d = c[w.from] });
                    }
                }
            }
        }
        return a;
    }
    public static void goDijk(List<Edge>[] aa, int r, int n, long[] mind)
    {
        var pq = new PriorityQueue<Node>(n + 100000, 0);
        pq.Push(new Node { id = r, d = 0 });
        while (pq.Count() > 0)
        {
            var targ = pq.Pop();
            var nowd = targ.d;
            var nowid = targ.id;
            if (mind[nowid] < nowd) continue;
            mind[nowid] = nowd;
            foreach (var x in aa[nowid])
                if (nowd + x.d < mind[x.to])
                {
                    mind[x.to] = nowd + x.d;
                    pq.Push(new Node { id = x.to, d = nowd + x.d });
                }

        }
    }
}



Measured memory_bytes: 735784