#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long mod(long long a, long long b) {
  if (a > b)
    return (a - b);
  else
    return (b - a);
}
double distance(long long x1, long long y1, long long x2, long long y2) {
  return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2) * 1.0);
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) res = res * i;
  return res;
}
long long nCr(long long n, long long r) {
  return fact(n) / (fact(r) * fact(n - r));
}
bool isPerfectSquare(long double x) {
  long double sr = sqrt(x);
  return ((sr - floor(sr)) == 0);
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long maxSum(long long arr[], long long n, long long k) {
  if (n < k) {
    cout << "Invalid";
    return -1;
  }
  long long res = 0;
  for (long long i = 0; i < k; i++) res += arr[i];
  long long curr_sum = res;
  for (long long i = k; i < n; i++) {
    curr_sum += arr[i] - arr[i - k];
    res = max(res, curr_sum);
  }
  return res;
}
long long maxi = 1e5 + 10;
void pri(long long v[], long long n, long long ind) {
  for (long long i = ind; i < n + ind; i++) {
    cout << v[i % n] << " ";
  }
}
void maxarray(long long a[], long long n) {
  long long maxsofar = INT_MIN, maxendinghere = 0;
  for (long long i = 0; i < n; i++) {
    maxendinghere = maxendinghere + a[i];
    if (maxsofar < maxendinghere) maxsofar = maxendinghere;
    if (maxendinghere < 0) maxendinghere = 0;
  }
  cout << maxsofar;
}
signed main() {
  char ch[26];
  for (long long i = 0; i < 26; i++) {
    ch[i] = 'a' + i;
  }
  long long n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  for (long long i = 0; i < m; i++) {
    char a, b;
    cin >> a >> b;
    for (long long j = 0; j < 26; j++) {
      if (ch[j] == a)
        ch[j] = b;
      else if (ch[j] == b)
        ch[j] = a;
    }
  }
  for (long long i = 0; i < n; i++) {
    s[i] = ch[s[i] - 'a'];
  }
  cout << s;
  return 0;
}
