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>
struct Side {
  int to;
  int next;
  int length;
  Side() { to = next = length = 0; }
  Side(int a, int b, int c) {
    to = a;
    length = b;
    next = c;
  }
};
int n;
int w[200001];
int sidecnt;
int head[200001];
Side sides[200001 << 1];
bool visited[200001];
int siz[200001];
int maxpart[200001] = {0x3f3f3f3f};
double d[200001];
double v[200001];
int ans1;
double ans2 = 1e20;
void inline adde(int x, int y, int z, bool repeat = true) {
  sides[++sidecnt] = Side(y, z, head[x]);
  head[x] = sidecnt;
  if (repeat) {
    adde(y, x, z, false);
  }
}
int center(int x, int father, int sum) {
  int rt = 0;
  siz[x] = 1;
  maxpart[x] = 0;
  int next = head[x];
  while (next != 0) {
    int y = sides[next].to;
    if (y != father && !visited[y]) {
      int subc = center(y, x, sum);
      maxpart[x] = std::max(maxpart[x], siz[y]);
      siz[x] += siz[y];
      if (maxpart[subc] < maxpart[rt]) {
        rt = subc;
      }
    }
    next = sides[next].next;
  }
  maxpart[x] = std::max(maxpart[x], sum - siz[x]);
  if (maxpart[x] < maxpart[rt]) {
    rt = x;
  }
  return rt;
}
void dfs1(int x, int father, double& sum, int dis) {
  sum += std::pow(dis, 1.5) * w[x];
  int next = head[x];
  while (next != 0) {
    int y = sides[next].to;
    if (y != father) {
      dfs1(y, x, sum, dis + sides[next].length);
    }
    next = sides[next].next;
  }
}
void dfs2(int x, int father, double& sum1, int dis) {
  sum1 += std::pow(dis, 0.5) * 1.5 * w[x];
  int next = head[x];
  while (next != 0) {
    int y = sides[next].to;
    if (y != father && !visited[y]) {
      dfs2(y, x, sum1, dis + sides[next].length);
    }
    next = sides[next].next;
  }
}
void calc(int x) {
  visited[x] = true;
  v[x] = 0;
  dfs1(x, 0, v[x], 0);
  if (v[x] < ans2) {
    ans1 = x;
    ans2 = v[x];
  }
  int next = head[x];
  double dsum = 0;
  while (next != 0) {
    int y = sides[next].to;
    if (!visited[y]) {
      d[y] = 0;
      dfs2(y, 0, d[y], sides[next].length);
      dsum += d[y];
    }
    next = sides[next].next;
  }
  next = head[x];
  while (next != 0) {
    int y = sides[next].to;
    if (!visited[y]) {
      if (dsum - d[y] * 2 < 0) {
        calc(center(y, x, siz[y]));
        break;
      }
    }
    next = sides[next].next;
  }
}
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);
    adde(x, y, z);
  }
  calc(center(1, 0, n));
  printf("%d %.10lf", ans1, ans2);
  return 0;
}
