3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
struct Edge {
  int y, z, ne;
};
Edge e[N * 2];
int last[N];
int n, ans1, num, rt, minn;
double ans2;
int size[N], der[N], w[N], v[N];
void add(int x, int y, int z) {
  e[++num] = (Edge){y, z, last[x]};
  last[x] = num;
}
double dfs2(int i, int fa, long long len, double p) {
  double tmp = pow(len, p) * w[i];
  for (int j = last[i]; j; j = e[j].ne)
    if (e[j].y != fa) tmp += dfs2(e[j].y, i, len + e[j].z, p);
  return tmp;
}
void dfs3(int i, int fa) {
  size[i] = 1;
  for (int j = last[i]; j; j = e[j].ne)
    if (!v[e[j].y] && e[j].y != fa) {
      dfs3(e[j].y, i);
      size[i] += size[e[j].y];
    }
}
void dfs4(int i, int fa, int p) {
  int tmp = size[p] - size[i];
  for (int j = last[i]; j; j = e[j].ne)
    if (!v[e[j].y] && e[j].y != fa) {
      dfs4(e[j].y, i, p);
      tmp = max(tmp, size[e[j].y]);
    }
  if (tmp < minn) rt = i, minn = tmp;
}
double dfs5(int i, int fa, long long len, double p) {
  double res = pow(len, p) * w[i];
  for (int j = last[i]; j; j = e[j].ne)
    if (!v[e[j].y] && e[j].y != fa) res += dfs5(e[j].y, i, len + e[j].z, p);
  return res;
}
void dfs(int i, int fa) {
  rt = 0;
  minn = n + 1;
  dfs3(i, 0);
  dfs4(i, 0, i);
  v[rt] = 1;
  double tmp = dfs2(rt, 0, 0, 1.5);
  if (tmp < ans2) ans2 = tmp, ans1 = rt;
  num = 0;
  int root = rt;
  double all = 0;
  for (int j = last[root]; j; j = e[j].ne)
    if (!v[e[j].y]) {
      der[++num] = dfs5(j, rt, e[j].z, 0.5);
      all -= der[num];
    }
  num = 0;
  for (int j = last[root]; j; j = e[j].ne)
    if (!v[e[j].y]) {
      num++;
      der[i] = all + 2 * der[i];
      if (der[i] < 0) dfs(e[j].y, rt);
    }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    add(x, y, z);
    add(y, x, z);
  }
  ans2 = 1e+18;
  dfs(1, 0);
  printf("%d %.6lf\n", ans1, ans2);
  return 0;
}
