#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define aint(a) a.begin(),a.end()
#define pii pair <int,int>
#define PII pair<pii , pii>
#define int long long 
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = (1<<11)+10 , maxq = 32, inf = 1e18+10 , lg = 19  ,sq = 707 ,mod = 1e18+7 ;
int dp2[maxn][33][33] , dp[33][33] ;
int n , m, a , b , k , dd[33] , d[33][33] , x[33] , w[33] ,mark[33][33] ;
priority_queue<pair<int,pii> > pq ; 
queue <pii> q; ;
vector <int> G[44];
void upd(int x ,int y ){
    for(int u : G[y]){
        d[u][x]--;
        if(d[u][x] == 0){
           q.push({u,x}) ; 
        }
        if(mark[u][x]==1)continue ;
        dp[u][x] = max(dp[u][x] , -dp[x][y]) ;
        pq.push({dp[u][x] , {u,x}});
    }
}
void ch(){
    while(sz(q)){
        int v = q.front().F , u = q.front().S ;q.pop() ;
        if(mark[v][u] == 1)continue ;
        mark[v][u] = 1; 
        upd(v,u) ;
    }
}

void sl(int ms){
    rep(i , 1 , n){
        rep(j , 1, n){
            d[i][j] = dd[i] ;
            dp[i][j] = -inf ;
            mark[i][j]= 0;
        }
    }
    while(sz(pq))pq.pop();
    while(sz(q))q.pop();
    rep(i ,0,k-1){
        if(ms>>i&1){
            rep(j , 1, n){
                for(int u : G[x[i]]){
                    d[u][j]--;
                    if(d[u][j]==0){
                        q.push({u,j}) ;
                    }
                    dp[u][j] = max(dp[u][j] , -dp2[ms^(1<<i)][j][x[i]]+w[i]) ; 
                }
            }
        }
    }
    ch();
    rep(i , 1 , n)rep(j , 1 , n)pq.push({dp[i][j] , {i,j}}) ;
    while(sz(pq)){
        int v = pq.top().S.F , u= pq.top().S.S;pq.pop() ;
        if(dp[v][u] <= 0){
            break ;
        }
        if(mark[v][u] == 1)continue ;
        mark[v][u] = 1;
        upd(v,u);
        ch();
    }
    ch();
    rep(i , 1,n)rep(j , 1 ,n)if(mark[i][j] == 0)dp[i][j] =0 ;
    rep(i , 1 , n)rep(j , 1,n)dp2[ms][i][j] = dp[i][j] ;
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> a >> b ;
    rep(i , 1 , m){
        int v , u ;
        cin >> v >> u ;
        G[u].pb(v);
        dd[v]++;
    }
    cin >> k;
    rep(i , 0 , k-1){
        cin>> x[i]>> w[i] ;
    }
    rep(ms , 1 , (1<<k)-1){
        sl(ms);
    }
    cout << dp2[(1<<k)-1][a][b] << "\n"; 
    return 0 ;
}
/*


*/