#include <bits/stdc++.h>

#define CPPIO std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);
#define freep(p) p ? delete p, p = nullptr, void(1) : void(0)

#ifdef BACKLIGHT
#include "debug.h"
#else
#define logd(...) ;
#endif

using i64 = int64_t;
using u64 = uint64_t;

void solve_case(int Case);

int main(int argc, char* argv[]) {
  CPPIO;
  int T = 1;
  // std::cin >> T;
  for (int t = 1; t <= T; ++t) {
    solve_case(t);
  }
  return 0;
}

void solve_case(int Case) {
  int n, m, q;
  std::cin >> n >> m >> q;

  std::vector<std::pair<int, int>> e(m);
  for (int i = 0; i < m; ++i) {
    int x, y;
    std::cin >> x >> y;
    --x, --y;
    e[i] = {x, y};
  }

  std::vector<bool> flag(m, false);
  std::vector<std::pair<int, int>> op(q);
  for (int i = 0; i < q; ++i) {
    std::string s;
    std::cin >> s;
    if (s[0] == 'G') {
      op[i] = {1, -1};
    } else {
      int x;
      std::cin >> x;
      --x;
      op[i] = {2, x};
      flag[x] = true;
    }
  }

  std::vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
  }

  std::vector<int> f(n);
  std::vector<i64> sum(n);
  for (int i = 0; i < n; ++i) {
    f[i] = i;
    sum[i] = a[i];
  }
  std::function<int(int)> find = [&](int x) -> int {
    if (x != f[x])
      f[x] = find(f[x]);
    return f[x];
  };
  std::function<void(int, int)> merge = [&](int x, int y) -> void {
    x = find(x);
    y = find(y);
    if (x == y)
      return;
    f[x] = y;
    sum[y] += sum[x];
  };

  for (int i = 0; i < m; ++i) {
    if (!flag[i]) {
      merge(e[i].first, e[i].second);
    }
  }

  u64 ans = 0, cnt = 0;
  for (int i = q - 1; i >= 0; --i) {
    ++cnt;
    auto [t, x] = op[i];
    if (t == 1) {
      int rt = find(0);
      ans += sum[rt] * cnt;
      cnt = 0;
    } else {
      merge(e[x].first, e[x].second);
    }
  }
  ++cnt;
  int rt = find(0);
  ans += sum[rt] * cnt;

  for (int i = 0; i < n; ++i) {
    if (find(i) != find(0) && find(i) == i) {
      ans += sum[i] * cnt;
    }
  }

  std::cout << ans << "\n";
}