#include <bits/stdc++.h>
using namespace std;

#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>;
vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using P = pair<ll, ll>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
void printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }
#define ldout fixed << setprecision(40) 

static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;

int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    int n, m; 
    while (cin >> n >> m && n && m) {
        vvll dl(n, vll(n, INF)), ds(n, vll(n, INF));
        rep(i, n) dl[i][i] = ds[i][i] = 0;

        rep(i, m) {
            ll x, y, t; char sl; cin >> x >> y >> t >> sl; x--; y--;
            (sl == 'L' ? dl : ds)[x][y] = (sl == 'L' ? dl : ds)[y][x] = t;
        }
        rep(k, n) rep(i, n) rep(j, n) 
            chmin(dl[i][j], dl[i][k]+dl[k][j]), chmin(ds[i][j], ds[i][k]+ds[k][j]);
        /*
        cout << "dl" << endl;
        cout << dl << endl;
        cout << "ds" << endl;
        cout << ds << endl;
        */

        ll r; cin >> r;
        vll z(r); rep(i, r) { cin >> z[i]; z[i]--; } 

        // ??????j???????????????i?????????????????????????????????????????????
        vvll dp(r+1, vll(n, INF));
        dp[0][z[0]] = 0;
        rep(i, r) { 
//            cout << i << "#####"<< endl;
            rep(j, n) { // j?????????
                if (dp[i][j] == INF) continue;
//                cout << i << " " << j << "#valid" << endl;
                rep(k, n) { // k???j?????????????????????, k????????????z[i]?????????
                    if (ds[j][k] == INF) continue;
                       ll tmp = (dp[i][j]/*????????§????????£????????????*/ + 
                            dl[i?z[i-1]:z[0]][j]/*j?????????????????????*/ +
                            ds[j][k]/*j??????k????§????*/ + 
                            dl[k][z[i]]/*k??????????????´???????§????*/);
                    chmin(dp[i+1][k], tmp);
//                    cout << dp[i+1][k] << " " << tmp << "#org" << endl;
#if 0
                    chmin(dp[i+1][k], 
                            dp[i][j]/*????????§????????£????????????*/ + 
                            ds[i?z[i-1]:z[0]][j]/*j?????????????????????*/ +
                            ds[j][k]/*j??????k????§????*/ + 
                            dl[k][z[i]]/*k??????????????´???????§????*/);
                    cout << dp[i+1][k] << "#aft" << endl;
                    cout << k << " "  <<
                            dp[i][j]/*????????§????????£????????????*/ << " "  <<
                            dl[i?z[i-1]:z[0]][j]/*j?????????????????????*/  << " " <<
                            ds[j][k]/*j??????k????§????*/ << " "  <<
                            dl[k][z[i]]/*k??????????????´???????§????*/ << endl;
//                    cout << (i?z[i-1]:z[0]) << " " << j << "prev pos" << endl;
                    if (dp[i+1][k] != INF) cout << i+1 << " " << k << " " << dp[i+1][k] << "###OK"<< endl;
#endif

                }
                if (dl[i?z[i-1]:z[0]][z[i]] != INF)
                    chmin(dp[i+1][j], 
                            dp[i][j]/*????????§????????£????????????*/ + 
                            dl[i?z[i-1]:z[0]][z[i]]/*????????´???????§????*/);
            } 
            /*
            rep(j, n) if (dp[i+1][j] != INF) 
                cout << i+1 << " " << j << " : " << dp[i+1][j] << endl;
                */
        }

        ll ret = INF;
        rep(j, n) {
            chmin(ret, dp[r][j]);
        }
        cout << ret << endl;
    }
    return 0;
}

Measured memory_bytes: 5252