#include<bits/stdc++.h>
namespace my_std{
    using namespace std;
    #define pii pair<int,int>
    #define fir first
    #define sec second
    #define MP make_pair
    #define rep(i,x,y) for (int i=(x);i<=(y);i++)
    #define drep(i,x,y) for (int i=(x);i>=(y);i--)
    #define go(x) for (int i=head[x];i;i=edge[i].nxt)
    #define templ template<typename T>
	#define sz 33
    typedef long long ll;
    typedef double db;
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    templ inline T rnd(T l,T r) {return uniform_int_distribution<T>(l,r)(rng);}
    templ inline bool chkmax(T &x,T y){return x<y?x=y,1:0;}
    templ inline bool chkmin(T &x,T y){return x>y?x=y,1:0;}
    templ inline void read(T& t) {
        t=0;char f=0,ch=getchar();double d=0.1;
        while(ch>'9'||ch<'0') f|=(ch=='-'),ch=getchar();
        while(ch<='9'&&ch>='0') t=t*10+ch-48,ch=getchar();
        if(ch=='.'){ch=getchar();while(ch<='9'&&ch>='0') t+=d*(ch^48),d*=0.1,ch=getchar();}
        t=(f?-t:t);
    }
    template<typename T,typename... Args>inline void read(T& t,Args&... args){read(t); read(args...);}
    void file() {
        #ifdef zqj
        freopen("a.in","r",stdin);
        #endif
    }
    inline void chktime() {
        #ifdef zqj
        cerr<<clock()/1000.0<<'\n';
        #endif
    }
    #ifdef mod
    ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x%mod) if (y&1) ret=ret*x%mod;return ret;}
    ll inv(ll x){return ksm(x,mod-2);}
    #else
    ll ksm(ll x,int y){ll ret=1;for (;y;y>>=1,x=x*x) if (y&1) ret=ret*x;return ret;}
    #endif
}
using namespace my_std;

int N;
ll f[2*sz*sz]; int type[2*sz*sz];
unordered_set<int>V[2*sz*sz],V1[2*sz*sz];

priority_queue<pair<ll,int>>S;

int del[2*sz*sz];
void delete_vertex(int x);
void delete_edge(int x,int v) {
	assert(V[x].count(v)&&V1[v].count(x));
	V[x].erase(v),V1[v].erase(x);
	if (chkmax(f[x],-f[v])) S.push({f[x],x});
	if (!V[x].size()&&!del[x]) delete_vertex(x);
}
void delete_vertex(int x) {
	del[x]=1;
	while (V[x].size()) delete_edge(x,*(V[x].begin()));
	while (V1[x].size()) delete_edge(*(V1[x].begin()),x);
};

void solve() {
	// queue<pii>q;
	// set<pair<ll,int>>S;
	// rep(i,0,N-1) {
	// 	for (auto v:V[i]) {
	// 		if (-f[v]<=f[i]) q.push({i,v});
	// 		del[i][v]=0;
	// 	}
	// 	S.insert({f[i],i});
	// }
	// while (q.size()||S.size()) {
	// 	while (q.size()) {
	// 		auto [x,v]=q.front(); q.pop();
	// 		V[x].erase(v),V1[v].erase(x);
	// 		if (-f[v]>f[x]) {
	// 			S.erase({x,f[x]}),f[x]=-f[v],S.insert({x,f[x]});
	// 			for (auto xx:V1[x]) if (-f[x]<=f[xx]) q.push({xx,x});
	// 		}
	// 		if (!V[x].size()) {
	// 			for (auto xx:V1[x]) q.push({xx,x});
	// 			S.erase({x,f[x]});
	// 		}
	// 	}
	// }

	// queue<int>q;
	// set<pair<ll,int>>S;
	// rep(i,0,N-1) {
	// 	unordered_set<int>vv;
	// 	for (auto v:V[i])
	// 		if (-f[v]<=f[i]) V1[v].erase(i);
	// 		else vv.insert(v);
	// 	V[i]=vv;
	// 	if (!vv.size()) q.push(i);
	// 	S.insert({f[i],i});
	// 	del[i]=0;
	// }
	// while (q.size()||S.size()) {
	// 	while (q.size()) {
	// 		int x=q.front(); q.pop();
	// 		del[x]=1;
	// 		S.erase({f[x],x});
	// 		for (auto v:V1[x]) if (!del[v]) {
	// 			if (-f[x]>f[v]) S.erase({f[v],v}),f[v]=-f[x],S.insert({f[v],v});
	// 			for (auto vv:V1[v]) if (!del[vv]&&-f[v]<=f[vv]) {
	// 				V[vv].erase(v);
	// 				if (!V[vv].size()) q.push(vv);
	// 			}
	// 			assert(V[v].count(x));
	// 			V[v].erase(x);
	// 			if (!V[v].size()) q.push(v);
	// 		}
	// 	}
	// 	if (S.size()) {
	// 		auto [w,x]=*(S.rbegin());
	// 		del[x]=1;
	// 		if (w<0) {
	// 			for (auto [w,x]:S) f[x]=0;
	// 			return;
	// 		}
	// 		for (auto v:V1[x]) if (!del[v]) {
	// 			assert(V[v].count(x));
	// 			V[v].erase(x);
	// 			if (!V[v].size()) q.push(v);
	// 		}
	// 	}
	// }

	rep(i,0,N-1) S.push({f[i],i}),del[i]=0;
	while (S.size()) {
		auto [w,x]=S.top(); S.pop();
		if (del[x]||f[x]!=w) continue;
		if (w<0) {
			rep(x,0,N-1) if (!del[x]) f[x]=0;
			return;
		}
		delete_vertex(x);
	}
}

int n,m,A,B,K;
int e[sz][sz];
int pos[sz],id[sz]; ll w[sz];
ll dp[1<<10][2][sz][sz];

int main() {
    file();
    read(n,m,A,B),--A,--B;
	int x,y;
	while (m--) read(x,y),e[x-1][y-1]=1;
	read(K);
	rep(i,0,n-1) id[i]=-1;
	rep(i,0,K-1) read(pos[i],w[i]),--pos[i],id[pos[i]]=i;
	rep(s,0,(1<<K)-1) {
		N=2*n*n;
		rep(t,0,1) rep(i,0,n-1) if (id[i]==-1||!(s>>id[i]&1)) rep(j,0,n-1) if (id[j]==-1||!(s>>id[j]&1)) {
			int x=t*n*n+i*n+j;
			f[x]=-1e18;
			rep(k,0,n-1) if (e[t?j:i][k]) {
				if (id[k]==-1||!(s>>id[k]&1)) {
					int y=(t?(i*n+k):(n*n+k*n+j));
					V[x].insert(y),V1[y].insert(x);
				}
				else {
					ll ww=w[id[k]];
					if (t) ww-=dp[1<<id[k]^s][0][i][k];
					else ww+=dp[1<<id[k]^s][1][k][j];
					chkmax(f[x],ww);
				}
			}
		}
		solve();
		rep(k,0,1) rep(i,0,n-1) if (id[i]==-1||!(s>>id[i]&1)) rep(j,0,n-1) if (id[j]==-1||!(s>>id[j]&1)) {
			int x=k*n*n+i*n+j;
			dp[s][k][i][j]=(k?-1:1)*f[x];
			V[x].clear(),V1[x].clear();
		}
	}
	cout<<dp[(1<<K)-1][0][A][B]<<'\n';
	return 0;
}