#include <cstdlib>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <vector>

#include <string>

using namespace std;

const int N = ;

const int inf = 0x3f3f3f3f;

int n, m, D1, D2, A, B;

vector<string>vs[];

int mp1[N][N];

int mp2[N][N];

void conn(int mp[][N], const string & s, int val) {

    int t = ;

    vector<int>vt;

    for (int i = ; i < s.length(); ++i) {

        if (s[i] != '+') t = t *  + s[i] - '';

        else {

            vt.push_back(t);

            t = ;

        }

    }

    vt.push_back(t);

    for (int i = ; i < (int)vt.size(); ++i) {

        for (int j = i+; j < (int)vt.size(); ++j) {

            mp[vt[i]][vt[j]] = min(mp[vt[i]][vt[j]], val*(j-i));

        }

    }

}

int dis[N];

char vis[N];

int dijkstra(int mp[][N]) {

    memset(dis, 0x3f, sizeof (dis));

    memset(vis, , sizeof (vis));

    dis[A] = ;

    for (int i = ; i < n; ++i) {

        int Min = inf, p;

        for (int j = ; j <= n; ++j) {

            if (!vis[j] && Min > dis[j]) {

                Min = dis[j];

                p = j;

            }

        }

        if  (p == B) break;

        vis[p] = ;

        for (int j = ; j <= n; ++j) {

            if (!vis[j] && dis[p]+mp[p][j] < dis[j]) {

                dis[j] = dis[p] + mp[p][j];

            }

        }

    }

    return dis[B];

}

void solve() {

    memset(mp1, 0x3f, sizeof (mp1));

    memset(mp2, 0x3f, sizeof (mp2));

    for (int i = ; i < (int)vs[].size(); ++i) {

        conn(mp1, vs[][i], D1);

    }

    for (int i = ; i < (int)vs[].size(); ++i) {

        conn(mp1, vs[][i], D1);

        conn(mp2, vs[][i], D2);

    }

    int ans = min(dijkstra(mp1), dijkstra(mp2));

    printf(ans == inf ? "-1\n" : "%d\n", ans);

}

int main() {

    int T, k;

    char str[];

    scanf("%d", &T);

    while (T--) {

        vs[].clear();

        vs[].clear();

        scanf("%d %d", &n, &m);

        for (int i = ; i < m; ++i) {

            scanf("%s %d", str, &k);

            if (k == ) vs[].push_back(str);

            else vs[].push_back(str);

        }

        scanf("%d %d %d %d", &D1, &D2, &A, &B);

        solve();

    }

    return ;

}