#include <bits/stdc++.h>
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream& operator,(ostream& out, T x) {
  out << x << " ";
  return out;
}
bool grid[107][107];
int N, M;
vector<string> user;
vector<pair<string, string> > msg;
map<string, int> userset;
int who[107];
void mark(int u, string mymsg) {
  mymsg = mymsg + "!";
  string str;
  for (int i = 0; i < (((int)(mymsg).size())); i++) {
    char ch = mymsg[i];
    if (('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z') ||
        ('0' <= ch && ch <= '9')) {
      str += ch;
    } else {
      if (((int)(str).size()) > 0) {
        if (userset.find(str) != userset.end()) {
          grid[u][userset[str]] = 0;
        }
      }
      str.clear();
    }
  }
}
int dp[107][107];
int rec(int prev, int pos) {
  if (pos >= M) {
    return 1;
  }
  int& ret = dp[prev][pos];
  if (ret != -2) {
    return ret;
  }
  if (who[pos] != -1) {
    if (who[pos] == prev) {
      return ret = -1;
    } else {
      if (rec(who[pos], pos + 1) == -1) {
        return ret = -1;
      } else {
        return ret = who[pos];
      }
    }
  }
  for (int i = 0; i < (N); i++) {
    if (grid[pos][i] && i != prev) {
      if (rec(i, pos + 1) != -1) {
        return ret = i;
      }
    }
  }
  return ret = -1;
}
void solve() {
  string str;
  for (int i = 0; i < (M); i++) {
    str = msg[i].second;
    for (int j = 0; j < (((int)(str).size())); j++) {
      if (str[j] == ':') {
        msg[i] =
            make_pair(str.substr(0, j), str.substr(j + 1, ((int)(str).size())));
      }
    }
  }
  int prevUser = -2;
  int u;
  memset(grid, 1, sizeof(grid));
  memset(who, -1, sizeof(who));
  for (int i = 0; i < (M); i++) {
    if (msg[i].first[0] == '?') {
      if (prevUser > -1) {
        grid[i][prevUser] = 0;
      }
      prevUser = -1;
      mark(i, msg[i].second);
    } else {
      u = userset[msg[i].first];
      who[i] = u;
      if (prevUser == -1) {
        grid[i - 1][u] = 0;
      }
      prevUser = u;
    }
  }
  for (int i = 0; i < (107); i++) {
    for (int j = 0; j < (107); j++) {
      dp[i][j] = -2;
    }
  }
  if (rec(N, 0) == -1) {
    printf("Impossible\n");
  } else {
    prevUser = N;
    for (int i = 0; i < (M); i++) {
      u = dp[prevUser][i];
      cout << user[u] << ":" << msg[i].second << endl;
      prevUser = u;
    }
  }
}
int main() {
  int kases, kasneo = 0;
  string str;
  scanf("%d", &kases);
  while (kases--) {
    user.clear();
    userset.clear();
    msg.clear();
    scanf("%d", &N);
    for (int i = 0; i < (N); i++) {
      cin >> str;
      user.push_back(str);
      userset[str] = i;
    }
    scanf("%d", &M);
    cin.ignore();
    for (int i = 0; i < (M); i++) {
      getline(cin, str);
      msg.push_back(make_pair("", str));
    }
    solve();
  }
  return 0;
}
