#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int h, w, d, n;
vector<string> field;
int r[20];
int x[100], y[100], s[100];

int num[55][55];
int dist[55][55];

int main() {
    while (cin >> h >> w >> d >> n) {
        field.resize(h);
        for (int i = 0; i < h; ++i) cin >> field[i];
        
        memset(num, 0, sizeof(num));
        r[0] = -1;
        for (int i = 0; i < d; ++i) cin >> r[i+1];
        r[d+1] = 100;
        for (int i = 0; i < n; ++i) cin >> y[i] >> x[i] >> s[i];
        
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w; ++j) {
                for (int k = 0; k < n; ++k) {
                    if ( (abs(i-x[k]) > r[s[k]] && abs(i-x[k]) <= r[s[k]+1] && abs(j-y[k]) <= r[s[k]+1])
                        || (abs(j-y[k]) > r[s[k]] && abs(j-y[k]) <= r[s[k]+1] && abs(i-x[k]) <= r[s[k]+1]) ) {
                        num[i][j]++;
                    }
                }
                //cout << pint(i, j) << ", " << field[i][j] << " : " << num[i][j] << endl;
            }
        }
        
        memset(dist, -1, sizeof(dist));
        int sx = -1, sy = -1;
        for (int i = 0; i < h; ++i) for (int j = 0; j < w; ++j) if (field[i][j] == 'D') sx = i, sy = j;
        
        dist[sx][sy] = 0;
        queue<pint> que;
        que.push(pint(sx, sy));
        
        while (!que.empty()) {
            pint p = que.front(); que.pop();
            
            for (int i = 0; i < 4; ++i) {
                pint np = pint(p.first + dx[i], p.second + dy[i]);
                if (np.first < 0 || np.first >= h || np.second < 0 || np.second >= w) continue;
                if (field[np.first][np.second] == '#') continue;
                
                if (dist[np.first][np.second] == -1) {
                    dist[np.first][np.second] = dist[p.first][p.second] + 1;
                    que.push(np);
                }
            }
        }
        
        bool yes = false, no = false;
        for (int i = 0; i < h; ++i) {
            for (int j = 0; j < w; ++j) {
                if (field[i][j] == '#') continue;
                if (num[i][j] == n) {
                    //cout << pint(i,j) << endl;
                    if (dist[i][j] == -1) no = true;
                    if (dist[i][j] >= 0) yes = true;
                }
            }
        }
         
        if (!yes && !no) puts("Broken");
        else if (yes && !no) puts("Yes");
        else if (!yes && no) puts("No");
        else if (yes && no) puts("Unknown");
    }
    
    return 0;
}


Measured memory_bytes: 1240