#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
void solve()
{
	int n,m;
	cin>>n>>m;
	vector<ll>a(n+1),b(n+1);
	for(int i = 1;i<=n;i++)cin>>a[i]>>b[i];
	
	vector<vector<int>>g(n+1),ng(2*n+1);
	for(int i = 1;i<=m;i++){
		int x,y;cin>>x>>y;
		g[x].push_back(y),g[y].push_back(x);
	}
	vector<int>d(n+1,n);
	//bfs dist
	queue<int>q;
	q.push(1);
	vector<int>vis(n+1);
	d[1] = 0;
	vis[1]++;
	while(q.size()){
		int u = q.front();
		q.pop();
		for(int v:g[u]){
			if(vis[v])continue;
			d[v] = min(d[v],d[u]+1);
			q.push(v);vis[v]++;
		}
	}
	
	ll mx=-inf,mx2 = -inf,id;
	vector<ll>v(2*n+1),nv(2*n+1);
	
	for(int i = 1;i<=n;i++){
		a[i] -= b[i]*d[i];
		if(a[i]-b[i]>mx){
			mx2 = mx;mx = a[i]-b[i];
			id = i;
		}
		else if(a[i]-b[i]>mx2){
			mx2 = a[i]-b[i];
		}
		v[i] = a[i]+b[i];
		v[i+n] = a[i];
		
		for(int v:g[i]){
			if(d[v]==d[i]+1){
				ng[i].push_back(v);
				ng[i+n].push_back(v+n);
			}
			else if(d[v]==d[i]){
				ng[i].push_back(v+n);
			}
		}
	}
	vis.clear();
	vis.resize(2*n+1,0);
	
	function<void(int)>dfs = [&](int u){
		if(vis[u])return;
		//cout<<u<<" "<<v[u]<<"\n";
		nv[u] = -inf;
		vis[u]++;
		for(int vv:ng[u]){
			dfs(vv);
			nv[u] = max(nv[u],max(v[vv],nv[vv]));
		}
	};
	
	for(int i = 1;i<=2*n;i++)dfs(i);
	//cout<<mx<<" "<<mx2<<"\n";
//	for(int i = 1;i<=2*n;i++){
//		cout<<nv[i]<<" \n"[i==2*n];
//	}
	
//	for(int i = 1;i<=n;i++){
//		cout<<i<<" :";
//		for(int v:ng[i])cout<<v<<" ";
//		cout<<"\n"; 
//	}
	//for(int i = 1;i<=n;i++)cout<<nv[i]<<" \n"[i==n];
	for(int i = 1;i<=n;i++){
		ll ans = -inf;
		if(d[i]!=1)continue;
		if(i==id){
			ans = mx2;
		}
		else{
			ans = mx;
		}
		ans = max(ans,nv[i]);
		cout<<ans<<" ";
	}
	
	
}
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	int t = 1;
	while(t--)solve();
}