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

namespace ConsoleApplication1
{
    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 temp.cost - cost;    // Reverse
        }
    }

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

            Dictionary<int, List<Edge>> nodeList = new Dictionary<int, List<Edge>>();
            for (int i = 0; i <= n; i++) nodeList.Add(i, new List<Edge>());

            string[] input;

            for (int i = 0; i < m; i++)
            {
                input = Console.ReadLine().Split(',');
                int a = int.Parse(input[0]);
                int b = int.Parse(input[1]);
                int c = int.Parse(input[2]);
                int d = int.Parse(input[3]);

                nodeList[a].Add(new Edge(b, c));
                nodeList[b].Add(new Edge(a, d));
            }

            input = Console.ReadLine().Split(',');
            int s = int.Parse(input[0]);
            int g = int.Parse(input[1]);
            int V = int.Parse(input[2]);
            int P = int.Parse(input[3]);

            int forward = Dijkstra(nodeList, s, g);
            int backward = Dijkstra(nodeList, g, s);

            Console.WriteLine(V - P - forward - backward);
        }

        static int Dijkstra(Dictionary<int, List<Edge>> nodeList, int start, int target)
        {
            PriorityQueue<Edge> pq = new PriorityQueue<Edge>();

            int n = nodeList.Count;

            int[] costs = Enumerable.Repeat(int.MaxValue, n).ToArray();
            bool[] visited = new bool[n];

            costs[start] = 0;
            pq.Enqueue(new Edge(start, 0));

            while (pq.Count > 0)
            {
                Edge cur = pq.Dequeue();
                visited[cur.target] = true;

                if (costs[cur.target] < cur.cost) continue;

                for (int j = 0; j < nodeList[cur.target].Count; j++)
                {
                    Edge next = nodeList[cur.target][j];

                    if (visited[next.target] == true) continue;

                    if (costs[next.target] > costs[cur.target] + next.cost)
                    {
                        costs[next.target] = costs[cur.target] + next.cost;
                        pq.Enqueue(new Edge(next.target, costs[next.target]));
                    }
                }
            }
            return costs[target];
        }
    }

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

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

        public int Count { get { return size; } }

        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;
        }

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

Measured memory_bytes: 9976