#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll n, m;
ll a[110], b[110], c[110];
bool vis[110], st[110];
vector<ll> G[110];
vector<int> tmp;

void init() {
    for (int i = 0; i <= n; i++)
        vis[i] = st[i] = false;
    tmp.clear();
    return;
}

bool dfs(ll x, ll hp) {
    vis[x] = true;
    // cout << x << ' ' << hp << endl;
    for (auto i : G[x]) {
        if (vis[i])
            continue;
        tmp.push_back(i);
        vis[i] = true;
    }
    ll id = -1, maxn = -1e18;
    bool flag = false;
    for (int i = 0; i < tmp.size(); i++) {
        if (!st[i])
            flag = true;
        if (c[tmp[i]] > maxn && hp >= a[tmp[i]] && !st[i]) {
            id = i;
            maxn = c[tmp[i]];
        }
    }
    st[id] = true;
    // cout << flag << ' ' << id << "hhh\n" << tmp.size() << endl;
    // for (int i = 0; i < tmp.size(); i++) {
    //     if (!st[i])
    //         cout << tmp[i] << ' ';
    // }
    // cout << '\n';
    if (flag && id == -1)
        return false;
    else if (!flag && id == -1)
        return true;
    return dfs(tmp[id], hp + c[tmp[id]]);
}

void solve() {
    cin >> n >> m;
    for (int i = 2; i <= n; i++) {
        cin >> a[i] >> b[i];
        c[i] = b[i] - a[i];
    }
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    ll l = 0, r = 1e18;
    while (l < r) {
        ll mid = l + r >> 1;
        init();
        if (dfs(1, mid))
            r = mid;
        else
            l = mid + 1;
    }
    // cout << dfs(1, 4) << endl;
    cout << l << '\n';
    return;
}

int main() {
    ios::sync_with_stdio(0);
    solve();
    return 0;
}