They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland, between each pair of cities there is a path (or else the fools would get upset). Also, between each pair of cities there is no more than one simple path (or else the fools would get lost). 

But that is not the end of Berland's special features. In this country fools sometimes visit each other and thus spoil the roads. The fools aren't very smart, so they always use only the simple paths.

A simple path is the path which goes through every Berland city not more than once.

The Berland government knows the paths which the fools use. Help the government count for each road, how many distinct fools can go on it.

Note how the fools' paths are given in the input.

Input

The first line contains a single integer n (2 ≤ n ≤ 105) — the number of cities. 

Each of the next n - 1 lines contains two space-separated integers ui, vi (1 ≤ ui, vi ≤ n, ui ≠ vi), that means that there is a road connecting cities ui and vi. 

The next line contains integer k (0 ≤ k ≤ 105) — the number of pairs of fools who visit each other. 

Next k lines contain two space-separated numbers. The i-th line (i > 0) contains numbers ai, bi (1 ≤ ai, bi ≤ n). That means that the fool number 2i - 1 lives in city ai and visits the fool number 2i, who lives in city bi. The given pairs describe simple paths, because between every pair of cities there is only one simple path.

Output

Print n - 1 integer. The integers should be separated by spaces. The i-th number should equal the number of fools who can go on the i-th road. The roads are numbered starting from one in the order, in which they occur in the input.

Examples

Input

5
1 2
1 3
2 4
2 5
2
1 4
3 5


Output

2 1 1 1 


Input

5
3 4
4 5
1 4
2 4
3
2 3
1 3
3 5


Output

3 1 1 1 

Note

In the first sample the fool number one goes on the first and third road and the fool number 3 goes on the second, first and fourth ones.

In the second sample, the fools number 1, 3 and 5 go on the first road, the fool number 5 will go on the second road, on the third road goes the fool number 3, and on the fourth one goes fool number 1.
import javax.print.DocFlavor;
import java.beans.IntrospectionException;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.lang.*;
import static java.lang.Math.*;
public class main implements Runnable {

    public static void main(String[] args) {
        new Thread(null, new main(), "Check2", 1 << 28).start();// to increse stack size in java
    }
    void init(ArrayList <Integer> adj[],int n){
        for(int i=0;i<=n;i++)adj[i]=new ArrayList<>();
    }
    HashMap <String,Integer> map;
    static long mod = (long) (1e9 + 7);
    public void run() {
        InputReader in = new InputReader(System.in);
        PrintWriter w = new PrintWriter(System.out);

        int n=in.nextInt();
        map=new HashMap<>();
        ArrayList <Integer> adj[]=new ArrayList[n+1];
        for(int i=1;i<=n;i++)adj[i]=new ArrayList<>();

        for(int i=0;i<n-1;i++){
            int u=in.nextInt();
            int v=in.nextInt();
            adj[u].add(v);
            adj[v].add(u);
            map.put(u+" "+v,i);
            map.put(v+" "+u,i);
        }
        int par[]=new int[n+1];
        lca obj=new lca(adj,n);
        obj.dfs2(1,new int[n+1],0,par);
        obj.build(par);
        int frq[]=new int[n+1];
        ans=new int[n+1];
        int q=in.nextInt();
        while (q-->0){

            int u=in.nextInt();
            int v=in.nextInt();
            int lca=obj.LCA(u,v);
            frq[u]++;
            frq[lca]--;
            frq[v]++;
            frq[lca]--;
        }
        dfs(1,0,adj,frq);
        for(int i=0;i<n-1;i++)
            w.print(ans[i]+" ");



        w.close();
    }
    int ans[];
    int dfs(int i,int par,ArrayList <Integer> adj[],int frq[]){
        int val2=0;
        for(Integer ne:adj[i]){
            if(ne!=par){
                int val=dfs(ne,i,adj,frq);
                val2+=val;
                ans[map.get(i+" "+ne)]=val;
            }

        }
        return val2+frq[i];
    }
    static void diji(int s, long dist[], ArrayList<pair> adj[]) {
        dist[s] = 0;
        PriorityQueue<pair> q = new PriorityQueue<>(new cmp());
        q.add(new pair(s, 0));
        while (!q.isEmpty()) {
            pair p1 = q.poll();
            for (pair ne : adj[p1.a]) {

                if ((long) p1.b + (long) ne.b < dist[ne.a]) {
                    dist[ne.a] = (long) p1.b + (long) ne.b;
                    pair p2 = new pair(ne.a, dist[ne.a]);
                    q.add(p2);

                }

            }
        }

    }

    class lca{


        ArrayList <Integer> list[];
        int table[][];
        int lvl[];
        int bit;
        int n;
        public void dfs2(int i,int v[],int parent,int par[]){
            if(v[i]==1)return;

            v[i]=1;
            par[i]=parent;

            for(Integer ne:list[i])
            {
                dfs2(ne,v,i,par);
            }

        }


        public int log2(int n){
            return (int)(Math.ceil(Math.log10(n)/Math.log10(2)));
        }
        public lca(ArrayList <Integer> a[],int n)
        {
            list=a;
            bit=log2(n+1);
            lvl=new int[n+1];

            table=new int[n+1][bit+1];
            this.n=n;
        }

        public void build(int par[])
        {
            for(int i=1;i<=n;i++)table[i][0]=i;
            for(int i=1;i<=n;i++)table[i][1]=par[i];
            for(int i=2;i<=bit;i++){
                for(int j=1;j<=n;j++){
                    table[j][i]=table[table[j][i-1]][i-1];
                }
            }

            int v[]=new int[n+1];
            dfs(1,v,0);
        }
        public void dfs(int i,int v[],int level){
            if(v[i]==1)return;

            lvl[i]=level;
            v[i]=1;
            for(Integer ne:list[i]){

                dfs(ne,v,level+1);
            }

        }

        public int kthancestor(int node,int k){

            int ans=node;
            for(int j=0;j<=bit;j++){

                if((k&(1<<j))!=0&&j!=bit){
                    ans=table[ans][j+1];
                }

            }
            return ans;

        }
        public int LCA(int node1,int node2){

            if(lvl[node1]>lvl[node2]){
                node1=kthancestor(node1,lvl[node1]-lvl[node2]);
            }
            else if(lvl[node1]<lvl[node2]){
                node2=kthancestor(node2,lvl[node2]-lvl[node1]);
            }
            if(node1==node2){
                return node1;
            }

            for(int i=bit;i>=0;i--){

                if(table[node1][i]!=table[node2][i]){

                    node1=table[node1][i];
                    node2=table[node2][i];

                }

            }

            return table[node1][1];
        }










    }
    static class cmp implements Comparator<pair>{

        public  int compare(pair o1,pair o2)
        {
            return o1.b<o2.b?-1:o1.b>o2.b?1:0;
        }

    }

    static class pair {
        int a;
        long b;
        pair(int a,long b){
            this.a=a;
            this.b=b;
        }
        public boolean equals(Object obj) {      //  override equals method for object to remove tem from arraylist and sets etc.......
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            pair other = (pair) obj;
            if (b!= other.b||a!=other.a)
                return false;
            return true;
        }
    }

    static long modinv(long a,long b)
    {
        long p=power(b,mod-2);

        p=a%mod*p%mod;
        p%=mod;

        return p;

    }

    static long power(long x,long y){
        if(y==0)return 1%mod;
        if(y==1)return x%mod;


        long res=1;
        x=x%mod;
        while(y>0){


            if((y%2)!=0){
                res=(res*x)%mod;
            }


            y=y/2;
            x=(x*x)%mod;
        }


        return res;

    }
    static  long gcd(long a,long b){

        if(b==0)return a;
        return gcd(b,a%b);
    }

    static  void sev(int a[],int n){

        for(int i=2;i<=n;i++)a[i]=i;
        for(int i=2;i<=n;i++){

            if(a[i]!=0){
                for(int j=2*i;j<=n;){

                    a[j]=0;
                    j=j+i;
                }
            }

        }

    }



    static class InputReader
    {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;

        public InputReader(InputStream stream)
        {
            this.stream = stream;
        }

        public int read()
        {
            if (numChars==-1)
                throw new InputMismatchException();

            if (curChar >= numChars)
            {
                curChar = 0;
                try
                {
                    numChars = stream.read(buf);
                }
                catch (IOException e)
                {
                    throw new InputMismatchException();
                }

                if(numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public String nextLine()
        {
            BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt()
        {
            int c = read();

            while(isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-')
            {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do
            {
                if(c<'0'||c>'9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong()
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = read();
            }
            long res = 0;

            do
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble()
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.')
            {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.')
            {
                c = read();
                double m = 1;
                while (!isSpaceChar(c))
                {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public String readString()
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do
            {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c)
        {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next()
        {
            return readString();
        }

        public interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
        }
    }







}