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

#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

const int N = 1e6;
long long INF = 1e18;

int n, m;
long long a[N], b[N], d[N], ans[N], val[N], dist[N];
int used[N];
vector<int> g[N], h[N];

void dfs(int v, int D) {
    used[v] = 1;
    dist[v] = D;
    ans[v] = -INF;
    for (int u : h[v]) {
        if (used[u] == 2) continue;
        assert(used[u] != 1);
        dfs(u, D + 1);
        ans[v] = max(ans[v], max(ans[u], a[u] - b[u] * D));
    }
    used[v] = 2;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i] >> b[i];
        a[i + n] = a[i];
        b[i + n] = b[i];
    }
    for (int i = 1, v, u; i <= m; ++i) {
        cin >> v >> u;
        g[v].push_back(u);
        g[u].push_back(v);
    }
    for (int i = 1; i <= n; ++i) {
        d[i] = -1;
    }
    d[1] = 0;
    queue<int> q;
    q.push(1);
    multiset<long long> lol;
    while (q.size()) {
        int v = q.front();
        lol.insert(a[v] - b[v] * (d[v] + 1));
        q.pop();
        for (auto u : g[v]) {
            if (d[u] == -1) {
                d[u] = d[v] + 1;
                q.push(u);
            }
        }
    }
    for (int v = 1; v <= n; ++v) {
        val[v] = -INF;
        for (auto u : g[v]) {
            if (d[u] == d[v] + 1) {
                h[v].push_back(u);
                h[v + n].push_back(u + n);
            }
            else if (d[u] == d[v]) {
                h[v].push_back(u + n);
            }
        }
    }
    dfs(1, 0);
    for (int v : g[1]) {
        lol.erase(lol.find(a[v] - b[v] * (d[v] + 1)));
        val[v] = max(ans[v], *lol.rbegin());
        lol.insert((a[v] - b[v] * (d[v] + 1)));
    }
    for (int i = 1; i <= n; ++i) {
        if (val[i] != -INF)
            cout << val[i] << '\n';
    }
}