#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 72 + 5;
const ll linf = 0x3f3f3f3f3f3f3f3f;

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

struct Data
{
	ll a,b;
	Data(void){}
	Data(ll _a,ll _b): a(_a), b(_b) {}
	int gettype(void) const { return a <= b;}
};
bool operator < (const Data &A,const Data &B)
{
	int tA = A.gettype(), tB = B.gettype();
	if(tA != tB) return tA > tB;
	return tA? A.a < B.a: A.b > B.b;
}
Data operator + (const Data &A,const Data &B)
{
	ll sum = - A.a + A.b - B.a + B.b;
	ll mn = min(- A.a, - A.a + A.b - B.a);
	return Data(-mn, sum - mn);
}

int n,m;
Data p[MAXN];
vector<int> g[MAXN];

namespace P1
{
	const int ALL = (1<<25) + 5;
	
	int gmask[MAXN];
	Data f[ALL];
	
	ll solve(void)
	{
		int all = (1<<(n-1)) - 1;
		
		for(int u=1; u<=n; ++u)
			for(int v: g[u])
				gmask[u] |= bbit(v-1);
		
		fill(f, f+all+1, Data(linf, -linf));
		f[0] = Data(0,0);
		for(int mask=0; mask<=all; ++mask) if(f[mask].a != linf)
		{
			for(int v=2; v<=n; ++v)
				if(!bdig(mask, v-2) && (((mask << 1) | 1) & gmask[v]) != 0)
				{
					int nxt = mask | bbit(v-2);
					auto t = f[mask] + p[v];
					if(t.a < f[nxt].a)
						f[nxt] = t;
				}
		}
		
		return f[all].a;
	}
}

namespace P2
{
	int anc[MAXN];
	
	int fa[MAXN];
	Data val[MAXN];
	int find(int u){ return fa[u] == u? u: fa[u] = find(fa[u]);}
	
	Data res;
	
	void dfs(int dep)
	{
		if(dep > n)
		{
			set< pair<Data,int> > q;
			iota(fa+1, fa+n+1, 1);
			for(int i=1; i<=n; ++i)
			{
				val[i] = p[i];
				if(i > 1) q.emplace(val[i], i);
			}
			
			while(q.size())
			{
				int u = q.begin() -> second; q.erase(q.begin());
				int v = find(anc[u]);
				if(v > 1) q.erase({val[v], v});
				
				fa[u] = v;
				val[v] = val[v] + val[u];
				
				if(v > 1) q.emplace(val[v], v);
			}
			
			res = min(res, val[1]);
			
			return;
		}
		for(int v: g[dep])
		{
			anc[dep] = v;
			dfs(dep+1);
		}
	}
	
	ll solve(void)
	{
		res = Data(linf, -linf);
		dfs(2);
		return res.a;
	}
}

int main(void)
{
	scanf("%d%d",&n,&m);
	for(int i=2; i<=n; ++i)
		scanf("%lld%lld",&p[i].a,&p[i].b);
	for(int i=1; i<=m; ++i)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		g[v].emplace_back(u);
	}
	
	ll ans;
	if(n <= 25)
		ans = P1 :: solve();
	else
		ans = P2 :: solve();
	
	printf("%lld\n",ans);
	return 0;
}