#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int N,M;
int A[3<<17],B[3<<17];
vector<int>G[3<<17];
int dist[3<<17];
vector<int>Vd[3<<17];
long long ans0[3<<17],ans1[3<<17],ans2[3<<17];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>M;
	for(int i=0;i<N;i++)cin>>A[i]>>B[i];
	for(int i=0;i<M;i++)
	{
		int u,v;
		cin>>u>>v;
		u--,v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	{//BFS
		for(int i=0;i<N;i++)dist[i]=1e9;
		dist[0]=0;
		vector<int>Q;
		Q.push_back(0);
		for(int i=0;i<Q.size();i++)
		{
			int u=Q[i];
			Vd[dist[u]].push_back(u);
			for(int v:G[u])if(dist[v]>dist[u]+1)
			{
				dist[v]=dist[u]+1;
				Q.push_back(v);
			}
		}
	}
	vector<pair<long long,int> >ans3;
	ans3.reserve(N);
	for(int d=N-1;d>=0;d--)
	{
		for(int u:Vd[d])
		{
			ans0[u]=-(long long)1e18;
			ans1[u]=-(long long)1e18;
			ans2[u]=-(long long)1e18;
			ans3.push_back(make_pair(A[u]-(long long)B[u]*(dist[u]+1),u));
			for(int v:G[u])if(dist[v]==dist[u]+1)
			{
				ans0[u]=max(ans0[u],max(ans0[v],A[v]-(long long)B[v]*(dist[v]-1)));
				ans1[u]=max(ans1[u],max(ans1[v],A[v]-(long long)B[v]*dist[v]));
				ans2[u]=max(ans2[u],ans2[v]);
			}
		}
		for(int u:Vd[d])
		{
			for(int v:G[u])if(dist[v]==dist[u])
			{
				ans2[u]=max(ans2[u],max(ans1[v],A[v]-(long long)B[v]*dist[v]));
			}
		}
	}
	sort(ans3.begin(),ans3.end());
	reverse(ans3.begin(),ans3.end());
	for(int v=0;v<N;v++)if(dist[v]==1)
	{
		long long r=max(ans0[v],ans2[v]);
		if(ans3[0].second!=v)r=max(r,ans3[0].first);
		else r=max(r,ans3[1].first);
		cout<<r<<"\n";
	}
}