#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef TRI<int, ll, ll> tri;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

class UF {
private:
    int sz; vector<int> par,nrank;
public:
    UF(){}
    UF(int node_size){ sz = node_size; par.resize(sz),nrank.resize(sz,0); rep(i,sz) par[i] = i; }
    int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } }
    void unite(int x,int y)
    { x = find(x),y = find(y); if(x == y) return;
    	if(nrank[x] < nrank[y]) swap(x,y); par[y] = x; if(nrank[x] == nrank[y]) nrank[x]++; }
    bool same(int x,int y){ return find(x) == find(y); }
};

vector<int> G[MAX_N];
ll bsum[MAX_N], val[MAX_N];
int unzip[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vl a(n),b(n);
    rep(i,n){
        cin >> a[i] >> b[i];
    }
    rep(i,m){
        int u,v;
        cin >> u >> v;
        --u, --v;
        G[u].pb(v), G[v].pb(u);
    }
    UF uf(n);
    vi index(n);
    iota(all(index),0);
    sort(all(index),[&](const int& p, const int& q){
        return a[p]-b[p] < a[q]-b[q];
    });
    rep(i,n){
        unzip[index[i]] = i;
    }
    each(id, index){
        vector<tri> vec;
        ll wa = b[id];
        each(v, G[id]){
            if(unzip[v] < unzip[id] && !uf.same(v, id)){
                vec.pb((tri){v, bsum[uf.find(v)], val[uf.find(v)]});
                wa += vec.back().se;
                uf.unite(v, id);
            }
        }
        int root = uf.find(id);
        bsum[root] = wa;
        ll mn = wa + max(0LL, a[id] - b[id]);
        each(p, vec){
            cmn(mn, wa-p.se+max(max(a[id]-b[id], 0LL), p.th));
        }
        val[root] = mn;
        if(id == index.back()){
            cout << mn << "\n";
        }
    }
    return 0;
}


Measured memory_bytes: 12272