/*Code by Leo2011*/
#include <bits/stdc++.h>

#define log printf
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define FOR(i, l, r) for (int(i) = (l); (i) <= (r); ++(i))
#define IOS                      \
	ios::sync_with_stdio(false); \
	cin.tie(nullptr);            \
	cout.tie(nullptr);

using namespace std;

typedef __int128 i128;
typedef long long ll;
typedef pair<int, int> PII;

const int N = 2e5 + 10;
int n, q;
char fa[N];
unordered_map<char, char> mp;
string s;

template <typename T>

inline T read() {
	T sum = 0, fl = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar())
		if (ch == '-') fl = -1;
	for (; isdigit(ch); ch = getchar()) sum = sum * 10 + ch - '0';
	return sum * fl;
}

template <typename T>

inline void write(T x) {
	if (x < 0) putchar('-'), write<T>(-x);
	static T sta[35];
	int top = 0;
	do { sta[top++] = x % 10, x /= 10; } while (x);
	while (top) putchar(sta[--top] + 48);
}

char findf(char c) {
	if (mp[c] == c) {
		fa[c] = c;
		return c;
	} else {
		fa[c] = findf(mp[c]);
		return fa[c];
	}
}

int main() {
	IOS cin >> n >> s >> q;
	FOR(i, 0, 25) mp[i + 'a'] = i + 'a';
	FOR(i, 1, q) {
		char a, b;
		cin >> a >> b;
		mp[a] = b;
	}
	FOR(i, 0, 25) findf(i + 'a');
	FOR(i, 0, n - 1) { cout << fa[s[i]]; };
	return 0;
}
// 我写了个啥啊（并查集？），貌似无限递归了

如果算法假了就直说吧