#include <bits/stdc++.h>
#pragma GCC optimize( \
    "Ofast,no-stack-protector,unroll-loops,no-stack-protector,fast-math")
using namespace std;
const int N = 5e3 + 5, M = 2 * N + 5;
int head[N], nxt[M], to[M], mx[M], ne, n, m;
void init() {
  ne = 0;
  memset(head, -1, n * sizeof head[0]);
}
void addEdge(int f, int t) {
  to[ne] = t;
  nxt[ne] = head[f];
  head[f] = ne++;
}
void addBiEdge(int a, int b) {
  addEdge(a, b);
  addEdge(b, a);
}
int par[N], parEdge[N], dep[N];
void dfs(int u = 0, int p = -1, int d = 0) {
  dep[u] = d, par[u] = p;
  for (int e = head[u]; ~e; e = nxt[e]) {
    int v = to[e];
    if (v == p) continue;
    dfs(v, u, d + 1);
    parEdge[v] = e;
  }
}
void upd(int &u, int &v, int &e) {
  if (dep[u] > dep[v]) {
    e = parEdge[u];
    u = par[u];
  } else {
    e = parEdge[v];
    v = par[v];
  }
}
void setVal(int u, int v, int val) {
  int e;
  while (u != v) {
    upd(u, v, e);
    mx[e] = mx[e ^ 1] = max({mx[e], mx[e ^ 1], val});
  }
}
int getMin(int u, int v) {
  int ret = 1e6, e;
  while (u != v) {
    upd(u, v, e);
    ret = min({ret, mx[e], mx[e ^ 1]});
  }
  return ret;
}
int u[N], v[N], val[N];
int main() {
  scanf("%d", &n);
  init();
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    addBiEdge(--u, --v);
  }
  dfs();
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; ++i) {
    scanf("%d %d %d", u + i, v + i, val + i);
    setVal(--u[i], --v[i], val[i]);
  }
  for (int i = 0; i < 2 * n; ++i)
    if (!mx[i]) mx[i] = 1e6;
  for (int i = 0; i < q; ++i)
    if (getMin(u[i], v[i]) != val[i]) exit(puts("-1"));
  for (int i = 0; i < 2 * n - 2; i += 2)
    printf("%d%c", mx[i], " \n"[i + 1 == 2 * n - 2]);
}
