#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;

typedef pair<int, int> P;
typedef pair<P, int> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
int DX[4] = {-1, 0, 1, 0};
int DY[4] = {0, -1, 0, 1};
string DS = "lurd";

class Trie {
public:
  vector<vector<int> > V;
  vector<vector<int> > par;

  Trie() {
    V.pb(vector<int>(26+1));
    par.pb(vector<int>(26+1, 0));
  }

  int find(string s) {
    int cur = 0;
    for (char ch : s) {
      int c = ch - 'a';
      cur = V[cur][c+1];
      if (cur == 0) return -1;
    }
    return cur;
  }

  void insert(string s) {
    int cur = 0;
    for (char ch : s) {
      int c = ch - 'a';
      if (V[cur][c+1] == 0) {
        V[cur][c+1] = V.size();
        V.pb(vector<int>(26+1));
        par.pb(vector<int>(26+1, -1));
      }
      cur = V[cur][c+1];
    }
  }

  int back(int s, int c) {
    if (par[s][c] != -1) return par[s][c];
    if (V[s][c+1] != 0) return s;
    return par[s][c] = back(V[s][0], c);
  }
};

class ACMatch {
public:
  Trie t;
  vector<int> acc;
  vector<P> flow[26];
  vector<string> S;

  void add_str(string s) {
    t.insert(s);
    S.pb(s);
  }

  void build() {
    acc.resize(t.V.size(), 0);
    for (string s : S) acc[t.find(s)]++;
    queue<int> q;
    rep(i, 26) {
      if (!t.V[0][i+1]) continue;
      t.V[t.V[0][i+1]][0] = 0;
      q.push(t.V[0][i+1]);
    }

    while (!q.empty()) {
      int k = q.front(); q.pop();
      rep(i, 26) {
        if (!t.V[k][i+1]) continue;
        q.push(t.V[k][i+1]);
        int pre = t.V[k][0];
        while (pre && t.V[pre][i+1]==0) pre = t.V[pre][0];
        t.V[t.V[k][i+1]][0] = t.V[pre][i+1];
        acc[t.V[k][i+1]] += acc[t.V[pre][i+1]];
      }
    }
    rep(c, 26) {
      rep(s, acc.size()) {
        int ns = t.back(s, c);
        ns = t.V[ns][c+1];
        flow[c].pb(P(ns, acc[ns]));
      }
    }
  }

  P move(int s, int c) {
    return flow[c][s];
  }

  int match(string S) {
    int sum = 0, cur = 0;
    for (char ch : S) {
      int c = ch - 'a';
      while (cur && t.V[cur][c+1]==0) cur = t.V[cur][0];
      cur = t.V[cur][c+1];
      sum += acc[cur];
    }
    return sum;
  }
};

int W, H, N;
int SX, SY, GX, GY;
char A[50][50];
int dp[50][50][100];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  while (cin >> H >> W) {
    if (H == 0 && W == 0) break;
    rep(y, H) {
      rep(x, W) {
        char c;
        cin >> c;
        if (c == 'S') SX = x, SY = y;
        if (c == 'G') GX = x, GY = y;
        A[x][y] = c == '#';
      }
    }
    ACMatch acm;
    cin >> N;
    rep(i, N) {
      string s;
      cin >> s;
      for (char &c : s) {
        if      (c == 'L') c = 'l';
        else if (c == 'U') c = 'u';
        else if (c == 'R') c = 'r';
        else if (c == 'D') c = 'd';
      }
      acm.add_str(s);
    }
    acm.build();
    int L = acm.acc.size();
    rep(x, W) {
      rep(y, H) {
        rep(s, L) {
          dp[x][y][s] = INF;
        }
      }
    }

    queue<P2> q;
    q.push(P2(P(SX, SY), 0));
    dp[SX][SY][0] = 0;

    while (!q.empty()) {
      int x = q.front()._1._1,
          y = q.front()._1._2,
          s = q.front()._2;
      q.pop();
      rep(k, 4) {
        int nx = x+DX[k], ny = y+DY[k];
        if (nx<0||nx>=W||ny<0||ny>=H) continue;
        if (A[nx][ny]) continue;
        P p = acm.move(s, DS[k]-'a');
        if (p._2 > 0) continue;
        int ns = p._1;
        if (dp[nx][ny][ns] > dp[x][y][s]+1) {
          dp[nx][ny][ns] = dp[x][y][s]+1;
          q.push(P2(P(nx, ny), ns));
        }
      }
    }
    int m = *min_element(dp[GX][GY], dp[GX][GY]+L);
    if (m == INF) m = -1;
    cout << m << "\n";
  }
  return 0;
}

Measured memory_bytes: 4188