#include <bits/stdc++.h>

using namespace std;

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;

const int INF = 1 << 29;
const double EPS = 1e-10;

double zero(double d) {
    return d < EPS ? 0.0 : d;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

// to avoid error on mingw
string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

int main() {
    cout.setf(ios::fixed, ios::floatfield);
    cout.precision(8);
    ios_base::sync_with_stdio(false);

    int N, M;
    while(cin >> N >> M, (N|M)) {
        vector< vi > dl(N, vi(N, INF));
        vector< vi > ds(N, vi(N, INF));
        rep(i, N) {
            dl[i][i] = ds[i][i] = 0;
        }

        rep(i, M) {
            int x, y, t;
            char sl;
            cin >> x >> y >> t >> sl;
            --x, --y;
            if(sl == 'L')
                dl[x][y] = dl[y][x] = t;
            else
                ds[x][y] = ds[y][x] = t;
        }

        // WF
        rep(k, N) {
            rep(i, N) {
                rep(j, N) {
                    dl[i][j] = min(dl[i][j], dl[i][k] + dl[k][j]);
                    ds[i][j] = min(ds[i][j], ds[i][k] + ds[k][j]);
                }
            }
        }

        int R;
        cin >> R;
        vi z(R);
        rep(i, R) {
            int tz;
            cin >> tz;
            z[i] = (--tz);
        }

        // dp[i][j] := z[i]まで移動し、船がjにある時の最小累計距離
        vector<vi> dp(R, vi(N,INF));
        dp[0][z[0]] = 0;

        REP(i, 1, R) {
            rep(j, N) {
                // 陸路のみ
                // もともと船がjにある場合のみ
                if(dp[i-1][j] != INF) {
                    dp[i][j] = min(dp[i][j],
                                   dp[i - 1][j] + dl[z[i - 1]][z[i]]);
                }
                // 陸路 -> 海路 -> 陸路
                // 海路でjに来る場合
                rep(k, N) {
                    if(dp[i-1][k] != INF) {
                        dp[i][j] = min(dp[i][j],
                                       dp[i - 1][k] + dl[z[i - 1]][k] + ds[k][j] + dl[j][z[i]]
                        );
                    }
                }
            }
        }

        cout << *min_element(all(dp[R-1])) << endl;
    }

    return 0;
}

Measured memory_bytes: 2332