#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1 << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(11);
	}
};
initializer _____;
struct UFT {
	vector< int > par;
	vector< int > siz;
	int getpar(int i) {
		if (par[i] == i)
			return i;
		return par[i] = getpar(par[i]);
	}
	bool unite(int i, int j) {
		int x = getpar(i);
		int y = getpar(j);
		if (x == y)
			return false;
		if (siz[x] < siz[y])
			swap(x, y);
		siz[x] += siz[y];
		par[y] = x;
		return true;
	}
	bool uf(int i, int j) {
		return getpar(i) == getpar(j);
	}
	UFT(int n) {
		par.resize(n);
		siz.assign(n, 1);
		for (int i = 0; i < n; i++)
			par[i] = i;
	}

private:
	int size(int x) {
		return siz[getpar(x)];
	}
};
int N, M, K, T, Q, L;
signed main() {
	cin >> N >> K >> L;
	UFT uf1(N), uf2(N);
	vector< int > ans(N);
	rep(i, K) {
		int p, q;
		cin >> p >> q;
		--p;
		--q;
		uf1.unite(p, q);
	}
	rep(i, L) {
		int r, s;
		cin >> r >> s;
		--r;
		--s;
		uf2.unite(r, s);
	}
	vector< pair< pii, int > > A(N);
	rep(i, N) {
		A[i].first = pii(uf1.getpar(i), uf2.getpar(i));
		A[i].second = i;
	}
	sort(A.begin(), A.end());
	A.push_back(make_pair(pii(-1, -1), -1));
	queue< int > q;
	rep(i, N + 1) {
		if (q.empty()) {
			q.push(A[i].second);
			continue;
		}
		if (A[i].first == A[i - 1].first) {
			q.push(A[i].second);
		} else {
			int num = q.size();
			while (!q.empty()) {
				int j = q.front();
				q.pop();
				ans[j] = num;
			}
			q.push(A[i].second);
		}
	}
	rep(i, N) cout << ans[i] << " ";
	cout << endl;
	return 0;
}

Measured memory_bytes: 18176