#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 75;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll n, m, a[N], b[N], d[N];
vector<int> G[N];
namespace solution1{
    const int M = (1 << 26) + 5;
    ll f[M], st[N];
    void solve(){
        _rep(i, 1, n) for(auto &j : G[i]) st[j] |= 1 << i - 1;
        mst(f, inf), f[0] = 0;
        int tot = (1 << n - 1) - 1;
        _rep(i, 0, tot - 1){
            _rep(j, 2, n){
                if(i >> (j - 2) & 1) continue;
                if(st[j] & (i << 1 | 1)){
                    f[i | (1 << j - 2)] = min(f[i | (1 << j - 2)], max(f[i], a[j]) - a[j] + b[j]);
                }
            }
        }
        ll ans = f[tot];
        _rep(i, 1, n) ans += a[i] - b[i];
        writeln(ans);
    }
}
int main(){
    read(n, m);
    _rep(i, 2, n) read(a[i], b[i]);
    _rep(i, 1, m){
        int u, v; read(u, v);
        G[u].pb(v), d[v]++;
    }
    if(n <= 27) return solution1::solve(), 0;
    return 0;
}