#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long z) {
  long long ret = 1;
  while (y > 0) {
    if (y & 1) ret = (ret * x) % z;
    x = (x * x) % z;
    y >>= 1;
  }
  return ret;
}
const long long N = 5e3 + 5, LG = 20, MX = 1e6;
long long dp[N][LG], L[N], val[N][N];
vector<long long> V[N];
pair<long long, long long> E[N];
void dfs(long long x, long long p) {
  L[x] = L[p] + 1;
  dp[x][0] = p;
  for (auto u : V[x]) {
    if (u == p) continue;
    dfs(u, x);
  }
  return;
}
long long LCA(long long a, long long b) {
  if (L[a] > L[b]) swap(a, b);
  for (long long j = LG - 1; j >= 0; --j) {
    if (L[b] - (1LL << j) >= L[a]) b = dp[b][j];
  }
  if (a == b) return a;
  for (long long j = LG - 1; j >= 0; --j) {
    if (dp[a][j] != dp[b][j]) {
      a = dp[a][j];
      b = dp[b][j];
    }
  }
  return dp[a][0];
}
struct query {
  long long a, b, c;
} Q[N];
bool cmp(struct query X, struct query Y) { return X.c > Y.c; }
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i <= n - 1; ++i) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    E[i] = make_pair(x, y);
    V[x].push_back(y);
    V[y].push_back(x);
  }
  dfs(1, 0);
  for (long long j = 1; j <= LG - 1; ++j)
    for (long long i = 1; i <= n; ++i) dp[i][j] = dp[dp[i][j - 1]][j - 1];
  long long m;
  scanf("%lld", &m);
  bool fl = 1;
  for (long long i = 1; i <= m; ++i) {
    scanf("%lld%lld%lld", &Q[i].a, &Q[i].b, &Q[i].c);
  }
  sort(Q + 1, Q + 1 + m, cmp);
  for (long long i = 1; i <= m; ++i) {
    long long x = Q[i].a, y = Q[i].b, z = Q[i].c;
    long long lca = LCA(x, y);
    long long tmp = x;
    while (tmp != lca) {
      long long p = tmp, q = dp[tmp][0];
      if (!val[p][q]) {
        val[p][q] = z;
        val[q][p] = z;
      }
      tmp = dp[tmp][0];
    }
    tmp = y;
    while (tmp != lca) {
      long long p = tmp, q = dp[tmp][0];
      if (!val[p][q]) {
        val[p][q] = z;
        val[q][p] = z;
      }
      tmp = dp[tmp][0];
    }
  }
  for (long long i = 1; i <= m; ++i) {
    scanf("%lld%lld%lld", &Q[i].a, &Q[i].b, &Q[i].c);
    long long x = Q[i].a, y = Q[i].b, z = Q[i].c;
    long long lca = LCA(x, y);
    long long tmp = x, mn = MX;
    while (tmp != lca) {
      mn = min(mn, val[tmp][dp[tmp][0]]);
      tmp = dp[tmp][0];
    }
    tmp = y;
    while (tmp != lca) {
      mn = min(mn, val[tmp][dp[tmp][0]]);
      tmp = dp[tmp][0];
    }
    if (mn != z) fl = 0;
  }
  if (!fl)
    printf("-1\n");
  else {
    for (long long i = 1; i <= n - 1; ++i) {
      long long x = E[i].first, y = E[i].second;
      if (!val[x][y])
        printf("%lld ", MX);
      else
        printf("%lld ", val[x][y]);
    }
    printf("\n");
  }
  return 0;
}
