#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 10;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


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

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

// edit

bool solve() {
    int N, M;
    cin >> N >> M;
    if (N == 0) return false;

    vvll ldist(N, vll(N, LINF)), sdist(N, vll(N, LINF));
    REP(i, N) {
        ldist[i][i] = sdist[i][i] = 0;
    }

    REP(i, M) {
        int x, y;
        ll t;
        char c;
        cin >> x >> y >> t >> c;
        x--, y--;
        if (c == 'L') {
            chmin(ldist[x][y], t);
            chmin(ldist[y][x], t);
        } else if (c == 'S') {
            chmin(sdist[x][y], t);
            chmin(sdist[y][x], t);
        }
    }

    REP(k, N) {
        REP(i, N) {
            REP(j, N) {
                chmin(ldist[i][j], ldist[i][k] + ldist[k][j]);
                chmin(sdist[i][j], sdist[i][k] + sdist[k][j]);
            }
        }
    }


    int R;
    cin >> R;
    vector<int> z(R);
    REP(i, R) {
        cin >> z[i];
        z[i]--;
    }


    vvll dp(R, vll(N, LINF)); // dp[i][j] := [0, i]まで配達済み、船がjにある、最短時間
    dp[0][z[0]] = 0;
    REP(i, R - 1) {
        REP(j, N) {
            chmin(dp[i + 1][j], dp[i][j] + ldist[z[i]][z[i + 1]]);

            REP(k, N) {
                chmin(dp[i + 1][j], dp[i][k] + ldist[z[i]][k] + sdist[k][j] + ldist[j][z[i + 1]]);
            }
        }
    }

    ll ans = LINF;

    REP(i, N) {
        chmin(ans, dp[R - 1][i]);
    }

    cout << ans << endl;

    return true;
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while (solve());


    return 0;
}



Measured memory_bytes: 5248