#include <iostream>
#include <queue>
#include <map>
const int maxn = 105;
using namespace std;
int n;
vector<int> dangerous[maxn];
vector<int> safe_graph[maxn];
map<pair<int, int>, bool> danger, safe;
int main() {
    ios_base::sync_with_stdio(false);
    cin >> n;

    int m;
    cin >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        dangerous[a].push_back(b);
        dangerous[b].push_back(a);

        danger[{a, b}] = true;
        danger[{b, a}] = true;
    }

    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);

        safe[{a, b}] = true;
        safe[{b, a}] = true;
    }

    for(int i = 1; i <= n; i++) {
        int res = 0;
        queue<int> q;
        q.push(i);
        q.push(0);

        vector<bool> visited(n + 1);
        visited[i] = true;

        while(!q.empty()) {
            int node = q.front();
            q.pop();

            int dist = q.front();
            q.pop();

            if(dist > 1) {
                if(!safe[{i, node}] and !danger[{i, node}]) {
                    res++;
                }
            }
            for(int j = 0; j < (int) dangerous[node].size(); j++) {
                int neighbour = dangerous[node][j];

                if(!visited[neighbour]) {
                    visited[neighbour] = true;
                    q.push(neighbour);
                    q.push(dist + 1);
                }
            }
        }
cout << res << "\n";

    }
    return 0;
}