#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(_Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,_Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

class Dijkstra {
public:
    static const int inf = 1<<29;
    int m_num;
    vector<vector<int> > m;
    void init(int n){
        m_num = n;
        m.resize(n);
        REP(i,n){
            m[i] = vector<int>(n,inf);
            m[i][i] = 0;
        }
    }
    void add(int u, int v, int e){
        dbgchk(u < 0 || u >= m_num || v < 0 || v >= m_num || u == v);
        m[u][v] = e;
    }
    int solve(int u, int v, vector<int> *result = NULL){
        dbgchk(u < 0 || u >= m_num || v < 0 || v >= m_num);
        int n = m_num;
        vector<int> c(n, -1);
        vector<int> r(n, -1);
        priority_queue<pair<int,pair<int,int> > > q;
        c[u] = 0;
        while(result != NULL || u != v){
            REP(i,n){
                if(u == i || m[u][i] == inf || c[i] >= 0) continue;
                q.push(mp(-(c[u]+m[u][i]),mp(u,i)));
            }
            if(q.empty()) break;
            int v = q.top().second.first;
            u = q.top().second.second;
            if(c[u] < 0){ c[u] = -q.top().first; r[u] = v; }
            q.pop();
        }
        if(result){
            result[0] = c; result[1] = r;
            return 0;
        }
        return c[v];
    }
};

int main(){
    int n, m;
    string s;
    cin >> n >> m;
    Dijkstra di;
    di.init(n);
    REP(i,m){
        cin >> s;
        int a,b,c,d;
        sscanf(s.c_str(), "%d,%d,%d,%d", &a, &b, &c, &d);
        di.add(a-1,b-1,c);
        di.add(b-1,a-1,d);
    }
    cin >> s;
    int fr,to,m1,m2;
    sscanf(s.c_str(), "%d,%d,%d,%d", &fr, &to, &m1, &m2);
    cout << m1 - (di.solve(fr-1,to-1) + di.solve(to-1,fr-1) + m2) << endl;
    return 0;
}

Measured memory_bytes: 1288