//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //
namespace debug {
template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; }
template <class c> char elo(...); template <class c> auto elo(c* a) -> decltype(cerr << *a, 0);
struct stream { ~stream() { cerr << endl; }
template <class c> typename enable_if <sizeof elo<c>(0) != 1, stream&>::type operator<<(c i) { cerr << boolalpha << i; return *this; }
template <class c> typename enable_if <sizeof elo<c>(0) == 1, stream&>::type operator<<(c i) { return *this << range(begin(i), end(i)); }
template <class a, class b> stream& operator<<(pair <a,b> p) { return *this << "(" << p.first << ", " << p.second << ")"; }
template <class c> stream& operator<<(rge<c> d) { *this << "["; for (auto it=d.b; it!=d.e; it++) *this << ", " + 2 * (it == d.b) << *it; return *this << "]"; }
stream& _dbg(const string& s, int i, int b) { return *this; } template <class c, class ... cs> stream& _dbg(const string& s, int i, int b, c arg, cs ... args) {
if (i == s.size()) return (*this << ": " << arg << ""); b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{'); b -= (s[i] == ')') + (s[i] == ']') + (s[i] == '}');
if (s[i] == ',' && b == 0) return (*this << ": " << arg << "     ")._dbg(s, i+1, b, args...); return (s[i] == ' ' ? *this : *this << s[i])._dbg(s, i+1, b, arg, args...); } };}
#define dout debug::stream()
#define dbg(...) ((dout << ">> ")._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__))
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //
#define f first
#define s second
#define sc scanf
#define pr printf
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define ss(x) ((int)((x).size()))
#define rep0(i, b) for(int (i)=(0);i<(b);(i)++)
#define rep1(i, b) for(int (i)=(1);i<=(b);(i)++)
#define rep(i, a, b) for(int (i)=(a);i<=(b);(i)++)
#define per(i, a, b) for(int (i)=(b);i>=(a);(i)--)
#define lowb(v, x) (lower_bound(all(v),(x))-(v).begin())
#define uppb(v, x) (upper_bound(all(v),(x))-(v).begin())
#define upgrade ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));}
template <class p, class q> pair<p,q> operator-(pair<p,q> a, pair<p,q> b) { return mp(a.f-b.f, a.s-b.s); }
template <class p, class q> pair<p,q> operator+(pair<p,q> a, pair<p,q> b) { return mp(a.f+b.f, a.s+b.s); }
template <class p, class q> void umin(p& a, const q& b) { if (a > b) a = b; }
template <class p, class q> void umax(p& a, const q& b) { if (a < b) a = b; }
using lf=long double;
using ll=long long;
using cll=const ll;
using cint=const int;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ //

const ll inf = 1000000000000000005;
const int N = 100010;
int n, m, q;
ll dis [N];
ll wei [3];
ll out = 0;
unordered_map <int,int> e [N];

void relax(int u, ll d){
	if (dis[u] <= d)
		return;
	if (dis[u] != inf)
		out -= dis[u];
	dis[u] = d;
	out += dis[u];
	for (pair <int,int> p : e[u]){
		int v = p.f;
		int w = p.s;
		relax(v, dis[u] + wei[w]);
	}
}

int main (){
	scanf ("%d%d%d%lld%lld", &n, &m, &q, &wei[1], &wei[2]);

	while (m--){
		int a, b, c;
		char type [5];
		scanf ("%d%d%s", &a, &b, type);
		if (type[0] == 'O'){
			c = 1;
		}else{
			c = 2;
		}
		e[a][b] = c;
		e[b][a] = c;
	}
	rep(i, 0, N - 1){
		dis[i] = inf;
	}
	relax(0, 0);

	int now = n;

	while (q--){
		int a, b;
		scanf ("%d%d", &a, &b);
		for (pair <int,int> p : e[a]){
			int v = p.f;
			int w = p.s;
			if (e[b].find(v) != e[b].end()){
				int val = (w - e[b][v] + 3) % 3;
				if (val != 0)
					e[now][v] = val;
				continue;
			}
			e[now][v] = w;
		}
		for (pair <int,int> p : e[b]){
			int v = p.f;
			int w = (3 - p.s) % 3;
			if (e[a].find(v) != e[a].end()){
				continue;
			}
			e[now][v] = w;
		}
		ll m = inf;
		for (pair <int,int> p : e[now]){
			int v = p.f;
			int w = p.s;
			umin(m, dis[v] + wei[w]);
		}
		relax(now, m);
		for (pair <int,int> p : e[now]){
			int v = p.f;
			int w = p.s;
			relax(v, dis[now] + wei[w]);
		}
		printf ("%lld\n", out);
		now += 1;
	}
	return 0;
}