Buggy python submission (verdict: Time Limit Exceeded):
import sys
from pprint import pprint

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N, M, K = map(int, sys.stdin.readline().strip().split())
friends_set = [set() for _ in range(N)]
block_set = [set() for _ in range(N)]

uf = UnionFind(N)

for _ in range(M):
    a, b = map(int, sys.stdin.readline().strip().split())
    uf.union(a-1, b-1)
    friends_set[a-1].add(b-1)
    friends_set[b-1].add(a-1)

for _ in range(K):
    c, d = map(int, sys.stdin.readline().strip().split())
    block_set[c-1].add(d-1)
    block_set[d-1].add(c-1)

# print(uf)
for i in range(N):
    n = uf.find(i)
    # print(len(uf.members(n)), len(friends_set[i]), len(block_set[i]))
    # print(uf.members(n), friends_set[i], block_set[i])
    print(len(set(uf.members(n)) - set([i]) - friends_set[i] - block_set[i]), end = " ")

Fixed submission:
import sys
from pprint import pprint

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N, M, K = map(int, sys.stdin.readline().strip().split())
friends_set = [set() for _ in range(N)]
block_set = [set() for _ in range(N)]

uf = UnionFind(N)

for _ in range(M):
    a, b = map(int, sys.stdin.readline().strip().split())
    uf.union(a-1, b-1)
    friends_set[a-1].add(b-1)
    friends_set[b-1].add(a-1)

for _ in range(K):
    c, d = map(int, sys.stdin.readline().strip().split())
    block_set[c-1].add(d-1)
    block_set[d-1].add(c-1)

# print(uf)
for i in range(N):
    # n = uf.find(i)
    # print(len(uf.members(n)), len(friends_set[i]), len(block_set[i]))
    # print(uf.members(n), friends_set[i], block_set[i])

    # TLE
    # print(len(set(uf.members(n)) - set([i]) - friends_set[i] - block_set[i]), end = " ")

    blocked = 0
    for j in block_set[i]:
        if uf.same(i, j):
            blocked += 1
    print(uf.size(i) - 1 - len(friends_set[i]) - blocked, end = " ")