#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream &operator<<(ostream &out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream &operator,(ostream &out, T x) {
  out << x << " ";
  return out;
}
struct person {
  int diff, x, y, id;
  bool operator<(const person &other) const { return diff < other.diff; }
  void print() {
    cerr << "diff = " << diff << ", x = " << x << ", y = " << y
         << ", id = " << id << endl;
  }
};
int N, M;
person competitors[300007];
long long scores[300007];
vector<pair<int, int> > enemy;
void solve() {
  for (int i = 0; i < (M); i++) {
    int u = enemy[i].first;
    int v = enemy[i].second;
    int p = ((competitors[u - 1].x + competitors[v - 1].y) <
                     (competitors[v - 1].x + competitors[u - 1].y)
                 ? (competitors[u - 1].x + competitors[v - 1].y)
                 : (competitors[v - 1].x + competitors[u - 1].y));
    scores[u] -= p;
    scores[v] -= p;
  }
  sort(competitors, competitors + N);
  long long sumOfX = 0;
  for (int i = 0; i < (N); i++) {
    int p = competitors[i].id;
    scores[p] += (long long)i * competitors[i].y;
    scores[p] += sumOfX;
    sumOfX += competitors[i].x;
  }
  long long sumOfY = 0;
  for (int i = N - 1; i >= 0; i--) {
    int p = competitors[i].id;
    scores[p] += (long long)(N - 1 - i) * competitors[i].x;
    scores[p] += sumOfY;
    sumOfY += competitors[i].y;
  }
  for (int i = 1; i <= N; i++) {
    if (i > 1) printf(" ");
    printf("%lld", scores[i]);
  }
  printf("\n");
}
int main() {
  scanf("%d %d", &N, &M);
  for (int i = 0; i < (N); i++) {
    scanf("%d %d", &competitors[i].x, &competitors[i].y);
    competitors[i].id = i + 1;
    competitors[i].diff = competitors[i].x - competitors[i].y;
  }
  int u, v;
  for (int i = 0; i < (M); i++) {
    scanf("%d %d", &u, &v);
    enemy.push_back(make_pair(u, v));
  }
  solve();
  return 0;
}
