#include <iostream>
#include <queue>
#include <map>
const int maxn = 1e5 + 10;
using namespace std;

int idx[maxn], sz[maxn];
void init() {
    for(int i = 0; i < maxn; i++) {
        idx[i] = i;
        sz[i] = 1;
    }
}

int find_root(int x) {
    while(x != idx[x]) {
        idx[x] = idx[idx[x]];
        x = idx[x];
    }
    return x;
}

void unite(int A, int B) {
    int rootA = find_root(A);
    int rootB = find_root(B);

    if(rootA != rootB) {
        if(sz[rootA] < sz[rootB]) {
            idx[rootA] = idx[rootB];
            sz[rootB] += sz[rootA];
        }
        else {
            idx[rootB] = idx[rootA];
            sz[rootA] += sz[rootB];
        }
    }
}
bool check(int A, int B) {
    return find_root(A) == find_root(B);
}

vector<int> danger_graph[maxn], safe_graph[maxn];
int main() {
    ios_base::sync_with_stdio(false);
    init();

    int n;
    cin >> n;

    int m;
    cin >> m;

    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;

        danger_graph[a].push_back(b);
        danger_graph[b].push_back(a);

        unite(a, b);
    }

    int o;
    cin >> o;
    for(int i = 0; i < o; i++) {
        int a, b;
        cin >> a >> b;

        safe_graph[a].push_back(b);
        safe_graph[b].push_back(a);
    }

    for(int i = 1; i <= n; i++) {
        int res = sz[find_root(i)] - 1;
        res -= (int) danger_graph[i].size();

        for(int j = 0; j < (int) safe_graph[i].size(); j++) {
            int neighbour = safe_graph[i][j];

            if(check(i, neighbour)) {
                res--;
            }
        }

        cout << res << endl;
    }

    return 0;
}