#include <bits/stdc++.h>
using namespace std;
struct zh {
  int u, v;
  int w;
} a[5005];
zh b[5005];
vector<int> mmap[5005];
int fa[5005];
int dep[5005];
int qz[5005][5005];
void dfs(int nnow, int ffa) {
  int len = mmap[nnow].size();
  int i = 0;
  while (i < len) {
    if (mmap[nnow][i] != ffa) {
      int tt = mmap[nnow][i];
      fa[tt] = nnow;
      dep[tt] = dep[nnow] + 1;
      dfs(tt, nnow);
    }
    i++;
  }
}
void gs(int u, int v, int w) {
  while (dep[u] > dep[v]) {
    qz[fa[u]][u] = max(qz[fa[u]][u], w);
    u = fa[u];
  }
  while (dep[u] < dep[v]) {
    qz[fa[v]][v] = max(qz[fa[v]][v], w);
    v = fa[v];
  }
  while (v != u) {
    qz[fa[u]][u] = max(qz[fa[u]][u], w);
    u = fa[u];
    qz[fa[v]][v] = max(qz[fa[v]][v], w);
    v = fa[v];
  }
}
int check(int u, int v, int w) {
  int mmin = 99999999;
  while (dep[u] > dep[v]) {
    mmin = min(qz[fa[u]][u], mmin);
    u = fa[u];
  }
  while (dep[u] < dep[v]) {
    mmin = min(qz[fa[v]][v], mmin);
    v = fa[v];
  }
  while (v != u) {
    mmin = min(qz[fa[u]][u], mmin);
    u = fa[u];
    mmin = min(qz[fa[v]][v], mmin);
    v = fa[v];
  }
  if (mmin == w) return 1;
  return 0;
}
int main() {
  int n;
  scanf("%d", &n);
  int i = 1;
  while (i < n) {
    int x, y;
    scanf("%d%d", &x, &y);
    a[i].u = x;
    a[i].v = y;
    mmap[x].push_back(y);
    mmap[y].push_back(x);
    i++;
  }
  dep[1] = 1;
  dfs(1, 1);
  int m;
  scanf("%d", &m);
  i = 1;
  while (i <= m) {
    scanf("%d%d%d", &b[i].u, &b[i].v, &b[i].w);
    gs(b[i].u, b[i].v, b[i].w);
    i++;
  }
  int f1 = 1;
  i = 1;
  while (i <= m) {
    if (check(b[i].u, b[i].v, b[i].w) == 0) {
      f1 = 0;
      break;
    }
    i++;
  }
  if (f1 == 0)
    cout << -1 << endl;
  else {
    i = 1;
    while (i < n) {
      int x = a[i].u;
      int y = a[i].v;
      int sum = qz[x][y] + qz[y][x];
      if (sum == 0) sum++;
      cout << sum << " ";
      i++;
    }
  }
  return 0;
}
