#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> adjlist;
const int nax = 5005;
int color[nax][nax];
int dist[nax];
int trace[nax];
vector<pair<int, int>> edge;
const int INF = 1e7;
struct Query {
  int a, b, val;
  bool operator<(const Query &other) const { return val < other.val; }
};
Query query[nax];
void input() {
  cin >> n;
  adjlist.resize(n + 1);
  for (int i = 1; i <= n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    adjlist[u].push_back(v);
    adjlist[v].push_back(u);
    edge.push_back({v, u});
  }
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    cin >> query[i].a >> query[i].b >> query[i].val;
  }
  sort(query + 1, query + m + 1);
  for (int i = 0; i < nax; ++i) {
    for (int j = 0; j < nax; ++j) {
      color[i][j] = 0;
    }
  }
}
void dfs(int v, int parent = -1) {
  trace[v] = parent;
  for (auto &c : adjlist[v]) {
    if (c == parent) continue;
    dfs(c, v);
  }
}
void check() {
  for (int i = 1; i <= m; ++i) {
    fill(dist, dist + n + 1, 0);
    fill(trace, trace + n + 1, 0);
    dfs(query[i].a);
    int now = query[i].b;
    int ans = INF;
    while (now != query[i].a) {
      ans = min(ans, color[now][trace[now]]);
      now = trace[now];
    }
    if (ans != query[i].val) {
      cout << -1;
      exit(0);
    }
  }
  for (auto &p : edge) {
    cout << color[p.first][p.second] << ' ';
  }
}
void solve() {
  fill(dist, dist + n + 1, 0);
  fill(trace, trace + n + 1, 0);
  for (int i = 1; i <= m; ++i) {
    fill(dist, dist + n + 1, 0);
    fill(trace, trace + n + 1, 0);
    dfs(query[i].a);
    int now = query[i].b;
    while (now != query[i].a) {
      color[now][trace[now]] = max(color[now][trace[now]], query[i].val);
      color[trace[now]][now] = max(color[trace[now]][now], query[i].val);
      now = trace[now];
    }
  }
  for (auto &p : edge) {
    if (color[p.first][p.second] == 0)
      color[p.first][p.second] = 1000000, color[p.second][p.first] = 1000000;
  }
  check();
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) {
    input();
    solve();
  }
  return 0;
}
